A note on permutation regularity
From MaRDI portal
Recommendations
Cites work
- 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
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- A permutation regularity lemma
- Bounding quantities related to the packing density of 1(+1) 2
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Efficient testing of large graphs
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Graph limits and parameter testing
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- Limits of dense graph sequences
- Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
- Quasirandom permutations
- Quick approximation to matrices and applications
- Testing permutation properties through subpermutations
- The packing density of other layered permutations
Cited in
(11)- A tightness property of relatively smooth permutations
- An observation on n-permutability
- Fast property testing and metrics for permutations
- A Note on Alternating Permutations
- Some remarks on the permutability of regular sequences
- A note on scrambling permutations
- On regularity lemmas and their algorithmic applications
- A Note on λ-Permutations
- A note on permutation regularity
- scientific article; zbMATH DE number 7771747 (Why is no real title available?)
- A permutation regularity lemma
This page was built for publication: A note on permutation regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5916098)