A note on permutation regularity

DOI10.1016/j.dam.2011.06.002zbMath1258.05122OpenAlexW2092086436MaRDI QIDQ5916098

Rudini Menezes Sampaio, Yoshiharu Kohayakawa, Carlos Hoppen

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.002

zbMATH Keywords

regularity lemmadiscrepancypatternscombinatorics of permutationsconvergence for permutation sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Fast Property Testing and Metrics for Permutations, On Regularity Lemmas and their Algorithmic Applications, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Testing permutation properties through subpermutations
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Bounding quantities related to the packing density of \(1(\ell+1)\ell\cdots 2\)
• A permutation regularity lemma
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Quick approximation to matrices and applications
• Quasirandom permutations
• The packing density of other layered permutations
• A combinatorial characterization of the testable graph properties
• Graph limits and parameter testing
• Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
• A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
• A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
• Efficient testing of large graphs