The minimum number of disjoint pairs in set systems and related problems (Q524186): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00493-014-3133-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1647101336 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1305.6715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple hypergraphs with maximal number of adjacent pairs of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems with few disjoint pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced subgraphs of the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner's Theorem and a Problem of Erdős, Katona and Kleitman / rank
 
Normal rank
Property / cites work
 
Property / cites work: On products of idempotent matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum number of disjoint pairs in a family of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for Erdős' matching conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Intersecting Families of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Size of a Hypergraph and its Matching Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most Probably Intersecting Families of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Erdős' extremal problem on matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bipartite subgraphs of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact bound in the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00493-014-3133-0 / rank
 
Normal rank

Latest revision as of 20:22, 9 December 2024

scientific article
Language Label Description Also known as
English
The minimum number of disjoint pairs in set systems and related problems
scientific article

    Statements

    The minimum number of disjoint pairs in set systems and related problems (English)
    0 references
    0 references
    0 references
    0 references
    25 April 2017
    0 references
    disjoint pairs
    0 references
    set systems
    0 references

    Identifiers