Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter Frankl / rank
Normal rank
 
Property / author
 
Property / author: Peter Frankl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963651820 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.06126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels / rank
 
Normal rank
Property / cites work
 
Property / cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability versions of Erdős-Ko-Rado type theorems via isoperimetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / 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: Q3770569 / 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 hypergraph with given matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families with no s pairwise disjoint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families with no matchings of size \(s\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inequalities for families without \(k\) pairwise disjoint members / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of sets with no matchings of sizes 3 and 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition‐free families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős matching conjecture and concentration inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE 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: The junta method in extremal hypergraph theory and Chvátal's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal number of subsets of a finite set No k of which are pairwise disjoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of large intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit and probabilistic constructions of distance graphs with small clique numbers and large chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular bipartite graphs and intersecting families / 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: Anti-Ramsey number of matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances on Dirac-type problems for hypergraphs / rank
 
Normal rank

Latest revision as of 21:32, 19 July 2024

scientific article
Language Label Description Also known as
English
Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
scientific article

    Statements

    Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (English)
    0 references
    0 references
    0 references
    17 July 2019
    0 references
    families of sets
    0 references
    extremal set theory
    0 references
    Erdős matching conjecture
    0 references
    stability
    0 references
    Kleitman's problem
    0 references
    anti-Ramsey-type problems
    0 references
    0 references
    0 references

    Identifiers