Asymptotic behavior of the chromatic index for hypergraphs

Nicholas Pippenger, Joel Spencer

Type: Article

Publication Date: 1989-05-01

Citations: 199

DOI: https://doi.org/10.1016/0097-3165(89)90074-5

View Publication

Locations

Journal of Combinatorial Theory Series A - View

Similar Works

Action	Title	Year	Authors
+	The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree	2012	Edyta Szymańska
+	Packing k-partite k-uniform hypergraphs	2015	Richard Mycroft
+	On the Degree, Size, and Chromatic Index of a Uniform Hypergraph	1997	Noga Alon Jeong Han Kim
+	Asymptotics of Hypergraph Matching, Covering and Coloring Problems	1995	Jeff Kahn
+	Packing k-partite k-uniform hypergraphs	2014	Richard Mycroft
+	Packing k-partite k-uniform hypergraphs	2014	Richard Mycroft
+	Codegree thresholds for covering 3-uniform hypergraphs	2015	Victor Falgas‐Ravry Yi Zhao
+ PDF Chat	The Degree and Codegree Threshold for Linear Triangle Covering in 3-Graphs	2023	Yuxuan Tang Yue Ma Xinmin Hou
+	Matchings and Tilings in Hypergraphs	2016	Chuanyun Zang
+	Critical chromatic number and the complexity of perfect packings in graphs	2006	Daniela Kühn Deryk Osthus
+ PDF Chat	Critical chromatic number and the complexity of perfect packings in graphs	2006	Daniela Kühn Deryk Osthus
+	Asymptotic Clique Covering Ratios of Distance Graphs	2002	Daphne D.-F. Liu Xuding Zhu
+	H-packing of k-chromatic graphs	2012	Raphael Yuster
+	An asymptotic upper bound for the chromatic index of random hypergraphs	2011	Yu. A. Budnikov
+ PDF Chat	Exact Minimum Codegree Threshold for <i>K</i><sup>−</sup><sub>4</sub>-Factors	2017	Jie Han Allan Lo Andrew Treglown Yi Zhao
+	The degree and codegree threshold for linear triangle covering in 3-graphs	2022	Yuxuan Tang Yue Ma Xinmin Hou
+	Asymptotically Good Covers in Hypergraphs: Extended Abstract of the Dissertation	1995	P. Mark Kayll
+ PDF Chat	The chromatic number of dense random graphs	2018	Annika Heckel
+	Packing chromatic number of distance graphs	2011	Jan Ekstein Přemysl Holub Bernard Lidický
+	Embedding problems in graphs and hypergraphs	2011	Andrew Treglown

Works That Cite This (178)

Action	Title	Year	Authors
+ PDF Chat	Minimum rainbow <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:mi>H</mml:mi></mml:math>-decompositions of graphs	2018	Lale Özkahya Yury Person
+ PDF Chat	Steiner Triple Systems with High Chromatic Index	2017	Darryn Bryant Charles J. Colbourn Daniel Horsley Ian M. Wanless
+	Almost all optimally coloured complete graphs contain a rainbow Hamilton path	2022	Stephen Gould Tom Kelly Daniela Kühn Deryk Osthus
+	Rainbow matchings for 3-uniform hypergraphs	2020	Hongliang Lu Xingxing Yu Xiaofan Yuan
+ PDF Chat	Hamilton transversals in random Latin squares	2022	Stephen Gould Tom Kelly
+ PDF Chat	Transversals in Latin Squares	2024	Richard Montgomery
+	On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings	2013	Jeff Kahn
+	On the genus of a random graph	1995	Vojtěch Rödl Robin Thomas
+	On the size-Ramsey number of hypergraphs	2015	Andrzej Dudek Steven La Fleur Dhruv Mubayi Vojtěch Rödl
+	The existence of k-radius sequences	2011	Simon R. Blackburn⋆

Works Cited by This (6)

Action	Title	Year	Authors
+	Ten lectures on the probabilistic method	1987	Joel Spencer
+ PDF Chat	Asymptotically good coverings	1985	Joel Spencer
+	Two combinatorial covering theorems	1974	Sherman K. Stein
+	Near Perfect Coverings in Graphs and Hypergraphs	1985	Péter Frankl V. Rödl
+	On the Size of a Maximum Transversal in a Steiner Triple System	1981	A.E. Brouwer
+	On a limit theorem in combinatorical analysis	2022	P. Erdős H. Hanani