Panchromatic 3-colorings of random hypergraphs

DOI10.1016/J.EJC.2019.01.006zbMath1414.05119OpenAlexW2914550559WikidataQ128450191 ScholiaQ128450191MaRDI QIDQ2422211

Dmitry Kravstov, Nikolay Krokhmal, Dmitriy A. Shabanov

Publication date: 18 June 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2019.01.006

zbMATH Keywords

2-colorabiliypanchromatic colorings of hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (16)

On the maximal cut in a random hypergraph ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ Estimating the \(r\)-colorability threshold for a random hypergraph ⋮ The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ On the structure of the set of panchromatic colorings of a random hypergraph ⋮ Random hypergraphs and property B ⋮ Modularity of some distance graphs ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ On the chromatic numbers of random hypergraphs ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ Panchromatic colorings of random hypergraphs ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ Equitable colorings of hypergraphs with few edges ⋮ On the weak chromatic number of random hypergraphs

Cites Work

• Unnamed Item
• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• Improved algorithms for colorings of simple hypergraphs and applications
• Colorings of \(b\)-simple hypergraphs
• A note on panchromatic colorings
• On the chromatic number of a random hypergraph
• On the concentration of the chromatic number of a random hypergraph
• On a generalization of Rubin's theorem
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Multipass greedy coloring of simple uniform hypergraphs
• The existence of panchromatic colourings for uniform hypergraphs
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• Two‐coloring random hypergraphs
• Colourings of Uniform Hypergraphs with Large Girth and Applications
• Hunting for sharp thresholds
• The condensation transition in random hypergraph 2-coloring

This page was built for publication: Panchromatic 3-colorings of random hypergraphs