Independence numbers of random sparse hypergraphs
type: Item
instance of: scholarly article
title: Independence numbers of random sparse hypergraphs
zbMATH Open document ID: 1377.05130
author: Aleksandr S. Semenov
author: D. A. Shabanov
published in: Discrete Mathematics and Applications
publication date: 2018-01-10T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 6823783
zbMATH Keywords: hypergraph
zbMATH Keywords: independence number
zbMATH Keywords: sparse hypergraphs
zbMATH Keywords: method of interpolation
zbMATH Keywords: Karp-Sipser algorithm
MaRDI profile type: Publication
full work available at URL: dma-2017-0025
OpenAlex ID: W2746746019
cites work: Q5610923
cites work: On colouring random graphs
cites work: Cliques in random graphs
cites work: On the independence number of random graphs
cites work: Q4263664
cites work: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
cites work: Maximum independent sets on random regular graphs
cites work: Q4705318
cites work: Q4410005
cites work: Component structure in the evolution of random hypergraphs
DOI: 10.1515/DMA-2017-0025
description: scientific article; zbMATH DE number 6823783