On the strong chromatic number of random hypergraphs

DOI10.1134/S1064562422010094zbMATH Open1491.05172MaRDI QIDQ2145753FDOQ2145753

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

Publication date: 20 June 2022

Published in: Doklady Mathematics (Search for Journal in Brave)

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

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)

Cites Work

• The two possible values of the chromatic number of a random graph
• The chromatic number of random graphs
• Upper-bounding the \(k\)-colorability threshold by counting covers
• On the chromatic number of a random hypergraph
• Estimating the \(r\)-colorability threshold for a random hypergraph
• Title not available (Why is that?)
• The Chromatic Number of Random Graphs for Most Average Degrees
• Hypergraph coloring up to condensation
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• On the weak chromatic number of random hypergraphs
• Two-Colorings of a Random Hypergraph
• On the strong chromatic number of a random 3-uniform hypergraph

Cited In (6)

• 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 strong chromatic number of random graphs
• On the concentration of values of \(j\)-chromatic numbers of random 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)