On the random version of the Erdős matching conjecture (Q1720300): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123018475, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1802.09871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number of random Kneser hypergraphs / 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: Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs / 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 minimum number of disjoint pairs in set systems and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removal and Stability for Erdös--Ko--Rado / rank
 
Normal rank
Property / cites work
 
Property / cites work: On “stability” in the Erdös--Ko--Rado Theorem / 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: 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 of sets with no matchings of sizes 3 and 4 / 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: On the chromatic number of a random subgraph of the Kneser graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random subgraphs of Kneser and Schrijver graphs / 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: On the stability of the Erdös-Ko-Rado theorem / 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

Latest revision as of 02:57, 18 July 2024

scientific article
Language Label Description Also known as
English
On the random version of the Erdős matching conjecture
scientific article

    Statements

    On the random version of the Erdős matching conjecture (English)
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Erdős matching conjecture
    0 references
    random Kneser hypergraphs
    0 references
    independence number
    0 references
    0 references

    Identifiers

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