Counting Independent Sets in Hypergraphs (Q5495674): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On uncrowded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(t\)-wise balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of partial Steiner systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly perfect matchings in regular simple hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the independence number of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal uncrowded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Turan's theorem for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of multivariate polynomials and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dense infinite Sidon sequence / rank
 
Normal rank

Revision as of 21:07, 8 July 2024

scientific article; zbMATH DE number 6325559
Language Label Description Also known as
English
Counting Independent Sets in Hypergraphs
scientific article; zbMATH DE number 6325559

    Statements

    Counting Independent Sets in Hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    triangle-free process
    0 references
    linear hypergraph
    0 references
    0 references