Chromatic numbers and homomorphisms of large girth hypergraphs
From MaRDI portal
Publication:3424892
zbMATH Open1128.05020MaRDI QIDQ3424892FDOQ3424892
Authors: Dwight Duffus, Vojtěch Rödl, Bill Sands, Norbert Sauer 
Publication date: 5 March 2007
Recommendations
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
- On regular hypergraphs with high girth and high chromatic number
- scientific article; zbMATH DE number 524137
- On coloring uniform hypergraphs without 3-cycles
- On colorings of non-uniform hypergraphs without short cycles
Cited In (9)
- High girth hypergraphs with unavoidable monochromatic or rainbow edges
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- List edge chromatic number of graphs with large girth
- \(H\)-colorings of dense hypergraphs
- A hypergraph-free construction of highly chromatic graphs without short cycles
- A surprising permanence of old motivations (a not-so-rigid story)
- Title not available (Why is that?)
- Constraints, MMSNP and expander relational structures
- Van der Waerden function and colorings of hypergraphs with large girth
This page was built for publication: Chromatic numbers and homomorphisms of large girth hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424892)
