Finitely forcible graphons and permutons (Q473103): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57601335 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005430465 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.2444 / 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: Sparse graphs: Metrics and random models / 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: On limits of finite graphs / 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: Limits of permutation sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on permutation regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing permutation properties through subpermutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poset limits and exchangeable random posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandom permutations are characterized by 4-point densities / 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: 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: Finitely forcible graphons / 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 the Minimal Density of Triangles in Graphs / 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 universality of graphs with uniformly distributed edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825110 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:36, 9 July 2024

scientific article
Language Label Description Also known as
English
Finitely forcible graphons and permutons
scientific article

    Statements

    Finitely forcible graphons and permutons (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 2014
    0 references
    combinatorial limits
    0 references
    graph limits
    0 references
    permutations
    0 references
    quasirandomness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers