Independent sets in hypergraphs omitting an intersection (Q6052482): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205882471 / 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: 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 de Bruijn-Erdős theorem for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the random greedy independent set algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5766611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse hypergraphs with low independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Properties of Systems of Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Independence Number of Steiner Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding just one intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Random 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: Hypergraph Ramsey numbers: triangles versus cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on embedding hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lovász local lemma in the space of random injections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of Mantel's theorem to \(k\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics of Ramsey theory. Collected papers of the Prague symposium on graph theory held in Prague, Czechoslovakia / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on independent sets in steiner systems / 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: Turan's theorem for \(k\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs / rank
 
Normal rank

Latest revision as of 05:12, 3 August 2024

scientific article; zbMATH DE number 7751098
Language Label Description Also known as
English
Independent sets in hypergraphs omitting an intersection
scientific article; zbMATH DE number 7751098

    Statements

    Independent sets in hypergraphs omitting an intersection (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2023
    0 references
    independent sets
    0 references
    L-intersecting families
    0 references
    pseudorandom hypergraphs
    0 references
    random greedy processes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references