Universal and unavoidable graphs (Q5886120): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Benjamin Sudakov / rank
Normal rank
 
Property / author
 
Property / author: Benjamin Sudakov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2994758570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse universal graphs / 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: Embedding nearly-spanning bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs Which Contain All Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Graphs for Bounded-Degree Trees and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Edge Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable stars in 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems of Paul Erd�s in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unavoidable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unavoidable hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal decompositions of graphs into mutually isomorphic subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Universal Graphs for Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdös-Stone Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost‐spanning universality in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885763 / 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: Q3348932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: What we know and what we do not know about Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096709 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:44, 31 July 2024

scientific article; zbMATH DE number 7670436
Language Label Description Also known as
English
Universal and unavoidable graphs
scientific article; zbMATH DE number 7670436

    Statements

    Universal and unavoidable graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references
    Turán number
    0 references
    universal graphs
    0 references
    probabilistic method
    0 references

    Identifiers

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