2-colorings of hypergraphs with large girth
From MaRDI portal
Publication:2197249
Recommendations
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph
- Coloring non-uniform hypergraphs without short cycles
- On coloring uniform hypergraphs without 3-cycles
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring
Cites work
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3188524 (Why is no real title available?)
- A note on random greedy coloring of uniform hypergraphs
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Color-critical graphs and hypergraphs with few edges: a survey
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Coloring hypergraphs with bounded cardinalities of edge intersections
- Coloring uniform hypergraphs with few edges
- Colourings of uniform hypergraphs with large girth and applications
- Combinatorial extremum problems for 2-colorings of hypergraphs
- Constructions of sparse uniform hypergraphs with high chromatic number
- Extremal problems for colourings of uniform hypergraphs
- Extremal problems in hypergraph colourings
- Improved algorithms for colorings of simple hypergraphs and applications
- Improved bounds and algorithms for hypergraph 2-coloring
- On a combinatorial problem. II
- On a property of families of sets
- On general two-colorings of uniform hypergraphs
- On one combinatorial problem of Erdös
- On small \(n\)-uniform hypergraphs with positive discrepancy
- On the difference between asymptotically good packings and coverings
- On the existence of regular n-graphs with given girth
- On the weak chromatic number of random hypergraphs
- Randomized algorithms for colourings of hypergraphs
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- Two-colorings of a random hypergraph
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring
Cited in
(7)- On 2-colorings of hypergraphs
- scientific article; zbMATH DE number 3908477 (Why is no real title available?)
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- On Ramsey families of sets
- Large 2-coloured matchings in 3-coloured complete hypergraphs
- Van der Waerden function and colorings of hypergraphs with large girth
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
This page was built for publication: 2-colorings of hypergraphs with large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197249)
