Colorings of partial Steiner systems and their applications
From MaRDI portal
Publication:2515181
DOI10.1007/s10958-015-2330-8zbMath1317.05096OpenAlexW2088271868MaRDI QIDQ2515181
Andrey B. Kupavskii, Dmitriy A. Shabanov
Publication date: 31 July 2015
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-015-2330-8
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (4)
Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ On the \(s\)-colorful number of a random hypergraph ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ On the chromatic number of a random subgraph of the Kneser graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(r\)-chromatic hypergraphs
- Threshold functions
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- Choosability in random hypergraphs
- Coloring uniform hypergraphs with few edges
- Random coloring method in the combinatorial problem of Erdős and Lovász
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Sharp thresholds of graph properties, and the $k$-sat problem
- On the 2-colorability of random hypergraphs
- Two‐coloring random hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- The condensation transition in random hypergraph 2-coloring
- The chromatic number of random graphs
- The chromatic number of random graphs
This page was built for publication: Colorings of partial Steiner systems and their applications