Independence in uniform linear triangle-free hypergraphs (Q279201): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Extremal uncrowded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The potential of greed for independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex independence number of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uncrowded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Methods for Finding Independent Sets in Hypergraphs / 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: A note on the independence number of triangle-free graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the independence number of arbitrary hypergraphs / rank
 
Normal rank

Latest revision as of 21:46, 11 July 2024

scientific article
Language Label Description Also known as
English
Independence in uniform linear triangle-free hypergraphs
scientific article

    Statements

    Identifiers