Embedding spanning subgraphs of small bandwidth (Q3503507): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How tight is the Bollobás-Komlós conjecture? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning 3-colourable subgraphs of small bandwidth in dense graphs / 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: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Blow-up Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling Turán theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Latest revision as of 11:22, 28 June 2024

scientific article
Language Label Description Also known as
English
Embedding spanning subgraphs of small bandwidth
scientific article

    Statements

    Embedding spanning subgraphs of small bandwidth (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    0 references
    extremal graph theory
    0 references
    spanning subgraphs
    0 references
    regularity lemma
    0 references
    0 references