A note on permutation regularity
Authors:
- Carlos HoppenCHCarlos Hoppen
- Yoshiharu KohayakawaYKYoshiharu Kohayakawa
- Rudini M. SampaioRSRudini M. Sampaio
- 1 December 2012
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 160 (18) , 2716-2727
Abstract
No abstract availableKeywords
Funding Information
- FAPERGS (10/0388-2)
- FAPESP (2007/56496-3)
- CNPq (484154/2010-9)
- CNPq (308509/2007-2, 484154/2010-9)
- FUNCAP (07.013.00/09)
- CNPq (484154/2010-9)
This publication has 14 references indexed in Scilit:
- A Combinatorial Characterization of the Testable Graph Properties: It's All About RegularitySIAM Journal on Computing, 2009
- Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testingAdvances in Mathematics, 2008
- A Characterization of the (Natural) Graph Properties Testable with One-Sided ErrorSIAM Journal on Computing, 2008
- Graph limits and parameter testing2006
- A Permutation Regularity LemmaThe Electronic Journal of Combinatorics, 2006
- Combinatorics of Permutations2004
- Quasirandom permutationsJournal of Combinatorial Theory, Series A, 2004
- The Packing Density of Other Layered PermutationsThe Electronic Journal of Combinatorics, 2002
- Efficient Testing of Large GraphsCombinatorica, 2000
- Quick Approximation to Matrices and ApplicationsCombinatorica, 1999