Densities in large permutations and parameter testing
From MaRDI portal
Publication:338581
DOI10.1016/j.ejc.2016.09.006zbMath1348.05010arXiv1412.5622OpenAlexW2522262817WikidataQ101496298 ScholiaQ101496298MaRDI QIDQ338581
Tereza Klimošová, Roman Glebov, Carlos Hoppen, Daniel Král', Hong Liu, Yoshiharu Kohayakawa
Publication date: 7 November 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5622
Related Items
Universal limits of substitution-closed permutation classes, Limits of \(k\)-dimensional poset sequences, The feasible region for consecutive patterns of permutations is a cycle polytope, The feasible region for consecutive patterns of permutations is a cycle polytope, Independence of permutation limits at infinitely many scales, Weak regularity and finitely forcible graph limits
Cites Work
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Finitely forcible graphons and permutons
- Testing permutation properties through subpermutations
- Testing properties of graphs and functions
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- On graphs with small subgraphs of large chromatic number
- Limits of permutation sequences
- Quasirandom permutations are characterized by 4-point densities
- Graph limits and parameter testing
- Property testing and its connection to learning and approximation
- Every Monotone Graph Property Is Testable
- Three theorems regarding testing graph properties
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Hereditary properties of permutations are strongly testable
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
