Cover Image

Emerging consecutive pattern avoidance

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hassler, Nathanaël, Kirgizov, Sergey
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Enumeration in the lattice of $q$-decreasing words
by: Baril, Jean-Luc, et al.
Published: (2025)

Grand zigzag knight's paths
by: Baril, Jean-Luc, et al.
Published: (2024)

Endhered patterns in matchings and RNA
by: Biane, Célia, et al.
Published: (2024)

A lattice on Dyck paths close to the Tamari lattice
by: Baril, Jean-Luc, et al.
Published: (2023)

The Combinatorics of Motzkin Polyominoes
by: Baril, Jean-Luc, et al.
Published: (2024)

Greedy Gray Codes for some Restricted Classes of Binary Words
by: Hassler, Nathanaël, et al.
Published: (2024)

4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)

Structure and growth of $\mathbb{R}$-bonacci words
by: Dovgal, Sergey, et al.
Published: (2023)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

Computing random $r$-orthogonal Latin squares
by: Bereg, Sergey
Published: (2023)

An involution for trivariate symmetries of vincular patterns
by: Chen, Joanna N., et al.
Published: (2025)

Non-detectable patterns hidden within sequences of bits
by: Allen, David, et al.
Published: (2024)

Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)

Efficient counting of permutation patterns via double posets
by: Diehl, Joscha, et al.
Published: (2024)

Asymptotic normality of pattern counts in random maps II
by: Hainzl, Eva-Maria
Published: (2026)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
by: Kurapov, Sergey, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
by: Tian, Ting, et al.
Published: (2025)

Forbidden Patterns in Mixed Linear Layouts
by: Haun, Deborah, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)

Product Structure and Tree-Decompositions
by: Liu, Chun-Hung, et al.
Published: (2024)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

3-Colouring Planar Graphs
by: Dujmović, Vida, et al.
Published: (2025)

Nowhere-zero flow reconfiguration
by: Esperet, Louis, et al.
Published: (2025)

Consecutive and quasi-consecutive patterns: $\mathrm{des}$-Wilf classifications and generating functions
by: Wang, Yan, et al.
Published: (2025)

Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)

The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
by: Kurapov, Sergey, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
by: Kurapov, Sergey, et al.
Published: (2024)

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
by: Esperet, Louis, et al.
Published: (2023)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)

Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)

Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)

Progress on Self Identifying Codes
by: Jean, Devin, et al.
Published: (2025)