General independence sets in random strongly sparse hypergraphs

DOI10.1134/S0032946018010052zbMath1457.05082OpenAlexW2801321987MaRDI QIDQ2190919

Dmitriy A. Shabanov, Aleksandr S. Semenov

Publication date: 23 June 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946018010052

zbMATH Keywords

dominationhypergraph independent sets

Mathematics Subject Classification ID

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

Related Items

Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ On the concentration of the independence numbers of random hypergraphs ⋮ On the weak chromatic number of random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Component structure in the evolution of random hypergraphs
• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• Independence numbers of random sparse hypergraphs
• What we know and what we do not know about Turán numbers
• Hypergraph Independent Sets
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphs