2-colorings of hypergraphs with large girth
From MaRDI portal
Publication:2197249
DOI10.1134/S0001434620070202zbMATH Open1485.05057OpenAlexW3047600982MaRDI QIDQ2197249FDOQ2197249
Publication date: 31 August 2020
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434620070202
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
- Coloring uniform hypergraphs with few edges
- Constructions of sparse uniform hypergraphs with high chromatic number
- On the existence of regular n-graphs with given girth
- Title not available (Why is that?)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- Randomized algorithms for colourings of hypergraphs
- Extremal problems for colourings of uniform hypergraphs
- On a property of families of sets
- Improved bounds and algorithms for hypergraph 2-coloring
- Title not available (Why is that?)
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- A note on random greedy coloring of uniform hypergraphs
- Color-critical graphs and hypergraphs with few edges: a survey
- On a combinatorial problem. II
- Colourings of Uniform Hypergraphs with Large Girth and Applications
- On the difference between asymptotically good packings and coverings
- On general two-colorings of uniform hypergraphs
- On one combinatorial problem of Erdös
- Improved algorithms for colorings of simple hypergraphs and applications
- Coloring hypergraphs with bounded cardinalities of edge intersections
- Extremal problems in hypergraph colourings
- On the weak chromatic number of random hypergraphs
- On small \(n\)-uniform hypergraphs with positive discrepancy
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Combinatorial extremum problems for 2-colorings of hypergraphs
- Two-Colorings of a Random Hypergraph
Cited In (5)
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)
