On coloring uniform hypergraphs without 3-cycles
From MaRDI portal
Publication:446271
zbMATH Open1255.05127MaRDI QIDQ446271FDOQ446271
Authors: D. A. Shabanov Edit this on Wikidata
Publication date: 5 September 2012
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Recommendations
Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Density (toughness, etc.) (05C42) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cited In (17)
- Coloring sparse hypergraphs
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
- On 3-uniform hypergraphs without linear cycles
- Chromatic numbers and homomorphisms of large girth hypergraphs
- Colourings of uniform hypergraphs with large girth and applications
- 2-colorings of hypergraphs with large girth
- 3-uniform hypergraphs without a cycle of length five
- \(H\)-colorings of dense hypergraphs
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- On regular hypergraphs with high girth and high chromatic number
- ON HYPERGRAPH COLOURINGS
- Coloring non-uniform hypergraphs without short cycles
- Random constructions of hypergraphs with large girth and without panchromatic colorings
- Title not available (Why is that?)
- Constructions of sparse uniform hypergraphs with high chromatic number
- On 3-uniform hypergraphs without a cycle of a given length
- On rainbow-free colourings of uniform hypergraphs
This page was built for publication: On coloring uniform hypergraphs without 3-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446271)
