Cover Image

On de Bruijn Rings and Families of Almost Perfect Maps

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Stelldinger, Peer
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Almost Perfect Mutually Unbiased Bases that are Sparse
by: Kumar, Ajeet, et al.
Published: (2024)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
by: Beaudou, Laurent, et al.
Published: (2025)

Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
by: Genosar, Dor, et al.
Published: (2019)

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
by: Sawada, J., et al.
Published: (2023)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)

Ramanujan Graphs and Interlacing Families
by: Srivastava, Nikhil
Published: (2024)

Families without $s$-matchings: the other end
by: Kupavskii, Andrey, et al.
Published: (2026)

Note on the Number of Almost Ordinary Triangles
by: Dumitrescu, Adrian, et al.
Published: (2025)

On the Number of Almost Empty Monochromatic Triangles
by: Bhattacharya, Bhaswar B., et al.
Published: (2026)

Analogues of Bermond-Bollobás Conjecture for Cages Yield Expander Families
by: Eze, Leonard Chidiebere, et al.
Published: (2024)

On extremal factors of de Bruijn-like graphs
by: Álvarez, Nicolás, et al.
Published: (2023)

Families of tractable problems with respect to vertex-interval-membership width and its generalisations
by: Enright, Jessica, et al.
Published: (2025)

Perfect state transfer using Markovian quantum walk
by: Dutta, Supriyo
Published: (2022)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
by: Korhonen, Tuukka, et al.
Published: (2024)

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
by: Jeronimo, Fernando Granha, et al.
Published: (2022)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
by: Gadouleau, Maximilien, et al.
Published: (2024)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
by: Ghanbari, Babak, et al.
Published: (2026)

The Graph Pencil Method: Mapping Subgraph Densities to Stochastic Block Models
by: Gunderson, Lee M, et al.
Published: (2024)

Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, et al.
Published: (2024)

HIST-Critical Graphs and Malkevitch's Conjecture
by: Goedgebeur, Jan, et al.
Published: (2024)

Grid Minors and Products
by: Dujmović, Vida, et al.
Published: (2024)

An explicit condition for boundedly supermultiplicative subshifts
by: Bui, Vuong, et al.
Published: (2024)

Large planar $(n,m)$-cliques
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

On open-separating dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

Branch-depth is minor closure of contraction-deletion-depth
by: Briański, Marcin, et al.
Published: (2024)

On Iiro Honkala's contributions to identifying codes
by: Hudry, Olivier, et al.
Published: (2024)

Counting Colored Tilings on Grids and Graphs
by: Ramírez, José L., et al.
Published: (2024)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices
by: Pettie, Seth, et al.
Published: (2024)

Bootstrap percolation on rhombus tilings
by: Esnay, S, et al.
Published: (2024)

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

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

A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
by: Sun, Yali, et al.
Published: (2024)

Progressive and Rushed Dyck Paths
by: Bacher, Axel
Published: (2024)

Antimagic Labeling of Graphs Using Prime Numbers
by: Islam, Arafat, et al.
Published: (2024)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)