Chromatic Numbers and Homomorphisms of Large Girth Hypergraphs

Dwight Duffus, Vojtěch Rödl, Bill Sands, Norbert Sauer

Type: Book-Chapter

Publication Date: 2007-05-28

Citations: 5

DOI: https://doi.org/10.1007/3-540-33700-8_22

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Chromatic polynomials of hypergraphs	2000	Mieczysław Borowiecki Ewa Łazuka
+	Chromatic polynomial of hypergraphs	2009	Haixing Zhao
+	Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number	2015	Alina Eduardovna Khuzieva D. A. Shabanov
+	Chromatic number and girth	1975	Roger Cook
+	Hom complexes and chromatic numbers of graphs	2016	尚弘松下
+	Chromatic numbers of subgraphs	1973	Fred Galvin
+	Chromatic capacities of graphs and hypergraphs	2004	Joshua Evan Greene
+	Chromatic Polynomials and Chromaticity of Graphs	2005	Fengming Dong K. M. Koh K. L. Teo
+	Chromatic graphs	1962
+	Chromatic Graphs	1979	H. L. Dorwart Daniel T. Finkbeiner
+	Chromatic polynomials of hypergraphs and mixed hypergraphs	2020	Ruixue Zhang
+	Graphs with chromatic polynomial ∑l⩽m0lm0−l(λ)l	2002	Chengfu Ye Nian‐Zu Li
+	On chromatic polynomials of hypergraphs	2006	Ewa Drgas‐Burchardt Ewa Łazuka
+	On the Chromatic Polynomials of Hypergraphs	1985	許乃紅
+	Chromatic number, girth and maximal degree	1978	Béla Bollobás
+	Chromatic numbers of graphs — large gaps	2014	Assaf Rinot
+	Chromatic polynomials of connected graphs	1984	Chong-Yun Chao Lian-Chang Zhao
+	2-Colorings of Hypergraphs with Large Girth	2020	Yu. A. Demidovich
+	Degree Sequences and Chromatic Numbers of Graphs	2002	Narong Punnim
+	Chromatic number and subtrees of graphs	2016	Baogang Xu Yingli Zhang

Action	Title	Year	Authors
+ PDF Chat	High girth hypergraphs with unavoidable monochromatic or rainbow edges	2020	Maria Axenovich Annette Karrer
+	A surprising permanence of old motivations (a not-so-rigid story)	2008	Jaroslav Nešetřil
+ PDF Chat	Constraints, MMSNP and expander relational structures	2013	Gábor Kun
+	H-colorings of dense hypergraphs	2012	Edyta Szymańska
+	High girth hypergraphs with unavoidable monochromatic or rainbow edges	2016	Maria Axenovich Annette Karrer

Action	Title	Year	Authors
+	A short proof of the existence of highly chromatic hypergraphs without short cycles	1979	Jaroslav Nešetřil Vojtěch Rödl
+	Graph Theory and Probability	2009	P. Erdős
+	On sparse graphs with given colorings and homomorphisms	2003	Jaroslav Nešetřil Xuding Zhu
+ PDF Chat	Graph Theory and Probability	1959	Paul Erdős
+ PDF Chat	On chromatic number of graphs and set-systems	1966	Péter L. Erdős A. Hajnal