Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
type: Item
instance of: scholarly article
title: Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
zbMATH Open document ID: 1213.90210
author: Andrzej Dudek
author: Joanna Polcyn
author: Andrzej Ruciński
published in: Journal of Combinatorial Optimization
publication date: 2010-04-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5701530
zbMATH Keywords: fractional independence
zbMATH Keywords: random hypergraphs
MaRDI profile type: Publication
full work available at URL: s10878-008-9174-9
OpenAlex ID: W2171859373
cites work: On the number of subgraphs of prescribed type of graphs with a given number of edges
cites work: Threshold functions for small subgraphs
cites work: Some intersection theorems for ordered sets and graphs
cites work: Q3286850
cites work: On the number of copies of one hypergraph in another
cites work: Poisson approximation for large deviations
cites work: Q3360223
cites work: Q4521552
cites work: Upper tails for subgraph counts in random graphs
DOI: 10.1007/S10878-008-9174-9
description: scientific article; zbMATH DE number 5701530