On the Chromatic Index of Random Uniform Hypergraphs
From MaRDI portal
Publication:5251625
DOI10.1137/130942292zbMath1311.05141OpenAlexW2071751664MaRDI QIDQ5251625
Katarzyna Rybarczyk, Valentas Kurauskas
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
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large cliques in sparse random intersection graphs
- Asymptotic behavior of the chromatic index for hypergraphs
- On the independence number of random graphs
- The triangle-free process
- Differential equations for random processes and random graphs
- Intersecting families of discrete structures are typically trivial
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
- Constructions of independent sets in random intersection graphs
- Colouring Non-sparse Random Intersection Graphs
- Erdős–Ko–Rado in Random Hypergraphs
- Cliques in random graphs
- On Random Intersection Graphs: The Subgraph Problem
- Coloring Random Intersection Graphs and Complex Networks
- Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
- The chromatic number of random graphs
- The chromatic number of random graphs
- On the degree, size, and chromatic index of a uniform hypergraph