On the strong chromatic number of random hypergraphs

DOI10.1134/S1064562422010094MaRDI QIDQ2145753zbMATH OpenFDO

Authors T. G. Matveeva, Alina E. Khuzieva, D. A. Shabanov

Publication date 20 June 2022

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

colorings of hypergraphsrandom hypergraphsecond moment methodstrong chromatic numberprobability thresholds

Mathematics Subject Classification ID

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

Recommendations

• On the strong chromatic number of a random 3-uniform hypergraph
• Estimating the strong \(r\)-colorability threshold in random hypergraphs
• Bounds on threshold probabilities for coloring properties of random hypergraphs
• On the chromatic number of a random hypergraph
• Estimating the \(r\)-colorability threshold for a random hypergraph

Cites work

• scientific article; zbMATH DE number 1380583 (Why is no real title available?)
• Estimating the \(r\)-colorability threshold for a random hypergraph
• Hypergraph coloring up to condensation
• On the chromatic number of a random hypergraph
• On the strong chromatic number of a random 3-uniform hypergraph
• 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 for most average degrees
• The two possible values of the chromatic number of a random graph
• Two-colorings of a random hypergraph
• Upper-bounding the k-colorability threshold by counting covers

Cited in

(11)

• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• Approximation and Online Algorithms
• Bounds on threshold probabilities for coloring properties of random hypergraphs
• On the weak chromatic number of random hypergraphs
• On the strong chromatic number of a random 3-uniform hypergraph
• On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
• On the strong chromatic number of random graphs
• A note on rainbow-free colorings of uniform hypergraphs
• On the concentration of values of \(j\)-chromatic numbers of random hypergraphs
• Semi-strong colouring of intersecting hypergraphs
• Estimating the strong \(r\)-colorability threshold in random hypergraphs

This page was built for publication: On the strong chromatic number of random hypergraphs

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