Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
triangle decomposition
Description:
A partition of a graph’s edges into triangles, studied in graph theory and combinatorics.
Related topics:
Advanced Graph Theory Research (18%),
Limits and Structures in Graph Theory (11%),
Computational Geometry and Mesh Generation (11%),
Mathematics and Applications (9%),
Advanced Combinatorial Mathematics (9%)
OpenAlex ID:
keywords/triangle-decomposition
Edge-decompositions of graphs with high minimum degree
2015
·
Ben Barber
, Daniela Kühn
, et al.
·
Advances in Mathematics
·
101
Construction of ɛ-nets
1990
·
Jiří Matoušek
·
Discrete & Computational Geometry
·
87
PDF
Counting designs
2018
·
Peter Keevash
·
Journal of the European Mathematical Society
·
68
PDF
A New Fast Physical Optics for Smooth Surfaces by Means of a Numerical Theory of Diffraction
2010
·
F. Vico-Bondia
, M. Ferrando-Bataller
, et al.
·
IEEE Transactions on Antennas and Propagation
·
58
Fractional Triangle Decompositions in Graphs with Large Minimum Degree
2016
·
François Dross
·
SIAM Journal on Discrete Mathematics
·
49
PDF
Clique decompositions of multipartite graphs and completion of Latin squares
2017
·
Ben Barber
, Daniela Kühn
, et al.
·
Journal of Combinatorial Theory Series A
·
44
PDF
Progress towards Nash-Williams' conjecture on triangle decompositions
2020
·
Michelle Delcourt
, Luke Postle
·
Journal of Combinatorial Theory Series B
·
42
Realisations of the real semisimple Lie algebras: a method of construction
1985
·
C Burdik
·
Journal of Physics A Mathematical and General
·
36
PDF
Lower bounds for the quadratic assignment problem via triangle decompositions
1995
·
Stefan E. Karisch
, Franz Rendl
·
Mathematical Programming
·
33
Resolvable decomposition of Kn∗
1979
·
J.C Bermond
, A Germa
, et al.
·
Journal of Combinatorial Theory Series A
·
33
The Dehn function of SL(n;Z)
2013
·
Robert Young
·
Annals of Mathematics
·
31
PDF
Minimalist designs
2020
·
Ben Barber
, Stefan Glock
, et al.
·
Random Structures and Algorithms
·
28
PDF
The Divide-and-Conquer Deployment Algorithm Based on Triangles for Wireless Sensor Networks
2010
·
Liang Cheng Shiu
, Chao Yang Lee
, et al.
·
IEEE Sensors Journal
·
28
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
2009
·
Vladimir Gurvich
·
Discrete Applied Mathematics
·
28
PDF
Elementary Proof of the Cycle-Plus-Triangles Theorem
1994
·
H. Sachs
·
Les Cahiers du GERAD
·
26
Spectral Radius, Edge-Disjoint Cycles and Cycles of the Same Length
2022
·
Huiqiu Lin
, Mingqing Zhai
, et al.
·
The Electronic Journal of Combinatorics
·
24
PDF
Decompositions of complete graphs into triangles and Hamilton cycles
2004
·
Darryn Bryant
, Barbara Maenhaut
·
Journal of Combinatorial Designs
·
18
On orthogonal double covers of kn and a conjecture of chung and west
1995
·
H.‐D. O. F. Gronau
, R. C. Mullin
, et al.
·
Journal of Combinatorial Designs
·
18
On the Minimum Degree Required for a Triangle Decomposition
2020
·
Peter J. Dukes
, Daniel Horsley
·
SIAM Journal on Discrete Mathematics
·
17
PDF
An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours
2003
·
S.H. Lo
, W.X. Wang
·
Computer Methods in Applied Mechanics and Engineering
·
17
Decomposing Graphs into Edges and Triangles
2019
·
DANIEL KRÁL'
, BERNARD LIDICKÝ
, et al.
·
Combinatorics Probability Computing
·
16
PDF
The metamorphosis of λ-fold block designs with block size four into λ-fold triple systems
2002
·
C.C. Lindner
, A. Rosa
·
Journal of Statistical Planning and Inference
·
15
Robust and Optimized Algorithms for the Point‐in‐Polygon Inclusion Test without Pre‐processing
2009
·
J. J. Jiménez
, F. R. Feito
, et al.
·
Computer Graphics Forum
·
14
Beyond Nash-Williams: Counterexamples to clique decomposition thresholds for all cliques larger than triangles
2026
·
Michelle Delcourt
, Cicely Henderson
, et al.
·
Proceedings of the American Mathematical Society
·
12
PDF
Edge-decompositions of graphs with high minimum degree
2015
·
Ben Barber
, Daniela Kühn
, et al.
·
Electronic Notes in Discrete Mathematics
·
12
Show more works
View as search
Works count:
212
Citation count:
1,198
Year
Topic
Type