On the strong chromatic number of a random 3-uniform hypergraph

DOI10.1016/J.DISC.2020.112231MaRDI QIDQ2222935zbMATH OpenOpenAlexFDO

Authors Arseniy E. Balobanov, D. A. Shabanov

Publication date 27 January 2021

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2020.112231

zbMATH Keywords

random hypergraphssecond moment methodstrong colorings

Mathematics Subject Classification ID

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

Recommendations

• Estimating the strong \(r\)-colorability threshold in random hypergraphs
• On the strong chromatic number of random hypergraphs
• Estimating the \(r\)-colorability threshold for a random hypergraph
• On the weak chromatic number of random hypergraphs
• Panchromatic 3-coloring of a random hypergraph

Cites work

• scientific article; zbMATH DE number 1380583 (Why is no real title available?)
• A note on the sharp concentration of the chromatic number of random graphs
• Estimating the \(r\)-colorability threshold for a random hypergraph
• Hypergraph coloring up to condensation
• On the chromatic number of a random hypergraph
• On the chromatic number of random graphs
• On the weak chromatic number of random hypergraphs
• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• The chromatic number of random graphs
• The chromatic number of random graphs
• The chromatic number of random graphs for most average degrees
• The two possible values of the chromatic number of a random graph
• Upper-bounding the k-colorability threshold by counting covers

Cited in

(12)

• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• Bounds on threshold probabilities for coloring properties of random hypergraphs
• Panchromatic 3-colorings of random hypergraphs
• Estimating the \(r\)-colorability threshold for a random hypergraph
• On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
• Colorings of partial Steiner systems and their applications
• On the strong chromatic number of random hypergraphs
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• A note on rainbow-free colorings of uniform hypergraphs
• On two limit values of the chromatic number of a random hypergraph
• On the maximal cut in a random hypergraph
• Estimating the strong \(r\)-colorability threshold in random hypergraphs

This page was built for publication: On the strong chromatic number of a random 3-uniform hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222935)