Panchromatic 3-colorings of random hypergraphs

DOI10.1016/J.EJC.2019.01.006MaRDI QIDQ2422211zbMATH OpenOpenAlexWikidataFDO

Authors Dmitry Kravstov, Nikolay Krokhmal, D. 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

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

Recommendations

• Panchromatic 3-coloring of a random hypergraph
• Panchromatic colorings of random hypergraphs
• On panchromatic colourings of a random hypergraph
• On the strong chromatic number of a random 3-uniform hypergraph
• Chain method for panchromatic colorings of hypergraphs

Cites work

• A note on panchromatic colorings
• Colorings of b-simple hypergraphs
• Colourings of uniform hypergraphs with large girth and applications
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• Hunting for sharp thresholds
• Improved algorithms for colorings of simple hypergraphs and applications
• Multipass greedy coloring of simple uniform hypergraphs
• On a generalization of Rubin's theorem
• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• On the chromatic number of a random hypergraph
• On the concentration of the chromatic number of a random hypergraph
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• The condensation transition in random hypergraph 2-coloring
• The existence of panchromatic colourings for uniform hypergraphs
• Two‐coloring random hypergraphs

Cited in

(20)

• Panchromatic 3-coloring of a random hypergraph
• Panchromatic colorings of random hypergraphs
• Lower bounds on the clique-chromatic numbers of some distance graphs
• On the maximal cut in 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
• 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
• 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
• Random constructions of hypergraphs with large girth and without panchromatic colorings
• On two limit values of the chromatic number of a random hypergraph
• On panchromatic colourings of a random hypergraph
• On the structure of the set of panchromatic colorings of a random hypergraph
• Two values of the chromatic number of a sparse random graph

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

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