An improved upper bound on the density of universal random graphs (Q4982616): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q101496253, #quickstatements; #temporary_batch_1708557319324
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20545 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967358236 / 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: Embedding nearly-spanning bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large bounded degree trees in expanding 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: Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic Friedman-Pippenger theorem on tree embeddings and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Upper Bound on the Density of Universal Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for large deviations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper tails for subgraph counts in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic methods for algorithmic discrete mathematics / rank
 
Normal rank

Latest revision as of 23:17, 9 July 2024

scientific article; zbMATH DE number 6423980
Language Label Description Also known as
English
An improved upper bound on the density of universal random graphs
scientific article; zbMATH DE number 6423980

    Statements

    An improved upper bound on the density of universal random graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 April 2015
    0 references
    random graphs
    0 references
    embeddings
    0 references
    universality
    0 references
    spanning subgraphs
    0 references

    Identifiers

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