Sparse partition universal graphs for graphs of bounded degree (Q633606): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2011.01.004 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Sparse universal graphs for bounded‐degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning subgraphs of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey number of paths, trees, and circuits. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of labeled graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number of a graph with bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with small subgraphs of large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ergodic Szemerédi theorem for commuting transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subsets inherit sparse \(\varepsilon\)-regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-Ramsey number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Induced Size-Ramsey Number of Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / 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: Q4407452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic version of the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey numbers of graphs with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hypergraph regularity method and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2011.01.004 / rank
 
Normal rank

Latest revision as of 23:09, 9 December 2024

scientific article
Language Label Description Also known as
English
Sparse partition universal graphs for graphs of bounded degree
scientific article

    Statements

    Sparse partition universal graphs for graphs of bounded degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2011
    0 references
    size-Ramsey numbers
    0 references
    universal graphs
    0 references
    regularity Lemma
    0 references
    random graphs
    0 references
    inheritance of regularity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers