Finitely forcible graph limits are universal (Q1621473): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2018.10.019 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1701.03846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs Do Jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solution to the 2/3 Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moments of two-variable functions and the uniqueness of graph limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. II. Multiway cuts and statistical physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph limits and parameter testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for graph regularity and removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak regularity and finitely forcible graph limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Graph Limits and Random Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite‐dimensional finitely forcible graphon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compactness and finite forcibility of graphons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of five-cycles in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Three-Colourable Common Graphs Exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of pentagons in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Bound for the 2/3 Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound based on Gromov's method of selecting heavily covered points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized quasirandom graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely forcible graphons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing properties of graphs and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Structure of Graphs with the Minimum Number of Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Number of<i>k</i>-Cliques in Graphs with Bounded Independence Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Hypergraphs with Forbidden 4-Vertex Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimal Density of Triangles in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universality of graphs with uniformly distributed edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825110 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2018.10.019 / rank
 
Normal rank

Latest revision as of 23:13, 10 December 2024

scientific article
Language Label Description Also known as
English
Finitely forcible graph limits are universal
scientific article

    Statements

    Finitely forcible graph limits are universal (English)
    0 references
    0 references
    0 references
    0 references
    8 November 2018
    0 references
    graph limits
    0 references
    extremal graph theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers