Degree versions of theorems on intersecting families via stability (Q2326331): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcta.2019.06.002 / 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: Independence numbers and chromatic numbers of the random subgraphs of some distance graphs / 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: On the stability of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum sum and the maximum product of sizes of cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum product of weights of cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of random subgraphs of some distance graph / 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: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorem with conditions on the maximal degree / 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: A degree version of the Hilton-Milner theorem / 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: Counting Intersecting and Pairs of Cross-Intersecting Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp results concerning disjoint cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Huang-Zhao theorem on intersecting families with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invitation to intersection problems for finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree / 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: Two extremal problems on intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a random subgraph of the Kneser graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of large intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversity of uniform intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular bipartite graphs and intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-trivially intersecting multi-part families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of random subgraphs of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of some Erdős-Ko-Rado type results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random subgraphs of Kneser graphs and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the independence number of a random subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nontrivial independent sets of bipartite graphs and cross-intersecting families / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127624242 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTA.2019.06.002 / rank
 
Normal rank

Latest revision as of 00:42, 18 December 2024

scientific article
Language Label Description Also known as
English
Degree versions of theorems on intersecting families via stability
scientific article

    Statements

    Degree versions of theorems on intersecting families via stability (English)
    0 references
    7 October 2019
    0 references
    intersecting families
    0 references
    Erdős-Ko-Rado theorem
    0 references
    extremal set theory
    0 references
    stability
    0 references
    0 references

    Identifiers