General independence sets in random strongly sparse hypergraphs

DOI10.1134/S0032946018010052MaRDI QIDQ2190919zbMATH OpenOpenAlexFDO

Authors Aleksandr S. Semenov, D. A. Shabanov

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

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

Recommendations

• Independence numbers of random sparse hypergraphs
• On the concentration of the independence numbers of random hypergraphs
• Independence numbers of hypergraphs with sparse neighborhoods.
• Independent sets in random sparse graphs
• On independent sets in hypergraphs

Cites work

• Component structure in the evolution of random hypergraphs
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1380583 (Why is no real title available?)
• Hypergraph Independent Sets
• Independence numbers of random sparse hypergraphs
• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• Random graphs.
• What we know and what we do not know about Turán numbers

Cited in

(4)

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

This page was built for publication: General independence sets in random strongly sparse hypergraphs

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