On the chromatic index of random uniform hypergraphs

DOI10.1137/130942292MaRDI QIDQ5251625zbMATH OpenOpenAlexFDO

Authors Valentas Kurauskas, Katarzyna Rybarczyk

Publication date 20 May 2015

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fb42bb4b7e3ae16f8add18f9ee7d6215fe58642e

zbMATH Keywords

chromatic indexgreedy algorithmrandom intersection graphrandom uniform hypergraph

Mathematics Subject Classification ID

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

Recommendations

• On the chromatic number of a random hypergraph
• An asymptotic upper bound for the chromatic index of random hypergraphs
• On the chromatic numbers of random hypergraphs
• Estimating the r-colorability threshold for a random hypergraph
• A note on random greedy coloring of uniform hypergraphs

Cites work

• Asymptotic behavior of the chromatic index for hypergraphs
• Cliques in random graphs
• Coloring Random Intersection Graphs and Complex Networks
• Colouring Non-sparse Random Intersection Graphs
• Constructions of independent sets in random intersection graphs
• Differential equations for random processes and random graphs
• Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
• Erdős-Ko-Rado in random hypergraphs
• scientific article; zbMATH DE number 986986 (Why is no real title available?)
• scientific article; zbMATH DE number 25252 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• Intersecting families of discrete structures are typically trivial
• Large cliques in sparse random intersection graphs
• On Random Intersection Graphs: The Subgraph Problem
• On the degree, size, and chromatic index of a uniform hypergraph
• On the independence number of random graphs
• The chromatic number of random graphs
• The chromatic number of random graphs
• The triangle-free process
• Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs

Cited in

(19)

• Choosability in random hypergraphs
• Randomly coloring simple hypergraphs
• On the chromatic number of a random hypergraph
• Randomly coloring simple hypergraphs with fewer colors
• Greedy colorings of uniform hypergraphs
• Constructions of sparse uniform hypergraphs with high chromatic number
• Colouring Non-sparse Random Intersection Graphs
• An asymptotic upper bound for the chromatic index of random hypergraphs
• On k-intersection edge colourings
• Random hypergraph coloring algorithms and the weak chromatic number
• scientific article; zbMATH DE number 1380583 (Why is no real title available?)
• scientific article; zbMATH DE number 878895 (Why is no real title available?)
• Boolean tensor decomposition for conjunctive queries with negation
• On the connectivity of proper colorings of random graphs and hypergraphs
• On the chromatic number of non-sparse random intersection graphs
• The chromatic number of random intersection graphs
• On the degree, size, and chromatic index of a uniform hypergraph
• The mod k $k$ chromatic index of random graphs
• Coloring hypergraphs from random lists

This page was built for publication: On the chromatic index of random uniform hypergraphs

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