Finitely forcible graphons and permutons

DOI10.1016/J.JCTB.2014.07.007zbMath1302.05200arXiv1307.2444OpenAlexW2005430465WikidataQ57601335 ScholiaQ57601335MaRDI QIDQ473103

Daniel Král', Roman Glebov, Tereza Klimošová, Andrzej Grzesik

Publication date: 21 November 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2444

zbMATH Keywords

permutationsgraph limitscombinatorial limitsquasirandomness

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99)

Related Items (24)

Bounded affine permutations. II: Avoidance of decreasing patterns ⋮ Linear-sized independent sets in random cographs and increasing subsequences in separable permutations ⋮ Scaling limits of permutation classes with a finite specification: a dichotomy ⋮ Densities in large permutations and parameter testing ⋮ The Brownian limit of separable permutations ⋮ Patterns in random permutations ⋮ The runsort permuton ⋮ The skew Brownian permuton: A new universality class for random constrained permutations ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ The number of \(n\)-queens configurations ⋮ Continuity of limit surfaces of locally uniform random permutations ⋮ Locally uniform random permutations with large increasing subsequences ⋮ Universal limits of substitution-closed permutation classes ⋮ Bounded affine permutations I. Pattern avoidance and enumeration ⋮ Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons ⋮ Limits of \(k\)-dimensional poset sequences ⋮ Semidefinite Programming and Ramsey Numbers ⋮ A Plancherel measure associated to set partitions and its limit ⋮ A Plancherel measure associated to set partitions and its limit ⋮ Quasi-random words and limits of word sequences ⋮ On random trees obtained from permutation graphs ⋮ Forcing generalised quasirandom graphs efficiently ⋮ Independence of permutation limits at infinitely many scales ⋮ Density maximizers of layered permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• A new lower bound based on Gromov's method of selecting heavily covered points
• Testing permutation properties through subpermutations
• Testing properties of graphs and functions
• On the maximum number of five-cycles in a triangle-free graph
• Limits of dense graph sequences
• On limits of finite graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On universality of graphs with uniformly distributed edges
• Limits of permutation sequences
• On the number of pentagons in triangle-free graphs
• Finitely forcible graphons
• Compactness and finite forcibility of graphons
• Quasirandom permutations are characterized by 4-point densities
• Poset limits and exchangeable random posets
• Generalized quasirandom graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Non-Three-Colourable Common Graphs Exist
• Graph limits and parameter testing
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Hypergraphs Do Jump
• A Solution to the 2/3 Conjecture
• On the Minimal Density of Triangles in Graphs
• A New Bound for the 2/3 Conjecture
• Sparse graphs: Metrics and random models
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Flag algebras
• Infinite‐dimensional finitely forcible graphon
• A note on permutation regularity
• Quasi-random graphs

This page was built for publication: Finitely forcible graphons and permutons