Corrádi and Hajnal's Theorem for Sparse Random Graphs (Q2883851): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q105583908 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.5443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and covering the vertices of a random graph by copies of a given graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in random uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth theorem for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Hamilton cycle problems in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local resilience of almost spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Functions for <i>H</i>-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle factors in sparse pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resilient Pancyclicity of Random and Pseudorandom Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Factors in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular pairs in sparse random graphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K^ 4\)-free subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local resilience of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:32, 5 July 2024

scientific article
Language Label Description Also known as
English
Corrádi and Hajnal's Theorem for Sparse Random Graphs
scientific article

    Statements

    Corrádi and Hajnal's Theorem for Sparse Random Graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    triangle packings
    0 references
    perfect \(H\)-packing
    0 references

    Identifiers

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