Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcta.2018.06.010 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963131687 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1801.03972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized 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: Conditional chromatic numbers with forbidden cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös–Ko–Rado Theorem—22 Years Later / 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: Q5567712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intersecting families of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdös-Ko-Rado theorem for direct products / 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 new short proof of the EKR theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Intersecting Families of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem / 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: Intersection patterns of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the Erdős-Chao Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Union-intersecting set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdős--Ko--Rado theorem for partial permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado-type theorems for colored sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / 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: A combinatorical proof of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs of Bounded Disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact bound in the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129634472 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTA.2018.06.010 / rank
 
Normal rank

Latest revision as of 02:08, 10 December 2024

scientific article
Language Label Description Also known as
English
Extremal \(G\)-free induced subgraphs of Kneser graphs
scientific article

    Statements

    Extremal \(G\)-free induced subgraphs of Kneser graphs (English)
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    Erdős-Ko-Rado theorem
    0 references
    Erdős matching conjecture
    0 references
    \((s, t)\)-union intersecting family
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers