Independence numbers of random sparse hypergraphs

DOI10.1515/dma-2017-0025zbMath1377.05130OpenAlexW2746746019MaRDI QIDQ1692740

Aleksandr S. Semenov, Dmitriy A. Shabanov

Publication date: 10 January 2018

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0025

zbMATH Keywords

hypergraphindependence numbersparse hypergraphsKarp-Sipser algorithmmethod of interpolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Related Items (2)

General independence sets in random strongly sparse hypergraphs ⋮ On the concentration of the independence numbers of random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the independence number of random graphs
• Component structure in the evolution of random hypergraphs
• Maximum independent sets on random regular graphs
• On colouring random graphs
• Cliques in random graphs
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

This page was built for publication: Independence numbers of random sparse hypergraphs