Cover Image

On the independence number of de Bruijn graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Majer, Pietro, Novaga, Matteo
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized Orthogonal de Bruijn and Kautz Sequences
by: Chen, Yuan-Pon, et al.
Published: (2025)

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

Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences
by: Chang, Zuling, et al.
Published: (2024)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

The independence and clique cover numbers of the squarefree graph
by: Alexeev, Boris, et al.
Published: (2025)

$L$-systems and the Lovász number
by: Linz, William
Published: (2024)

On the number of inequivalent linearized Reed-Solomon codes
by: Mannaert, Jonathan, et al.
Published: (2026)

Edge inducibility via local directed graphs
by: Chao, Ting-Wei, et al.
Published: (2025)

Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)

The asymptotic number of equivalence classes of linear codes with given dimension
by: Di Giusto, Andrea, et al.
Published: (2025)

On the stabilizer of the graph of linear functions over finite fields
by: Smaldore, Valentino, et al.
Published: (2024)

On the $(k,\ell)$-multiset anonymity measure for social graphs
by: Estrada-Moreno, Alejandro, et al.
Published: (2025)

The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
by: Bertuzzo, Matteo, et al.
Published: (2026)

The Coverage Depth Problem in DNA Storage Over Small Alphabets
by: Bertuzzo, Matteo, et al.
Published: (2025)

An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
by: Sason, Igal
Published: (2025)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

On the number of relevant variables for discrete functions
by: Potapov, V. N.
Published: (2024)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

Local minimality of the truncated octahedron for the isoperimetric problem on parallelohedra
by: Cesaroni, Annalisa, et al.
Published: (2026)

Storage codes on coset graphs with asymptotically unit rate
by: Barg, Alexander, et al.
Published: (2022)

Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
by: Caro, Yair, et al.
Published: (2024)

Game extensions of floppy graph metrics
by: Banakh, Taras, et al.
Published: (2023)

Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)

On de Bruijn Covering Sequences and Arrays
by: Chee, Yeow Meng, et al.
Published: (2024)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

The spanning number and the independence number of a subset of an abelian group
by: Bajnok, Bela
Published: (2024)

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
by: Bar-Lev, Daniella
Published: (2026)

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
by: Jakhar, Gunank, et al.
Published: (2026)

Triprojective almost perfect nonlinear permutations and functions
by: Göloğlu, Faruk, et al.
Published: (2026)

On the Number of Subsequences in the Nonbinary Deletion Channel
by: Li, Han, et al.
Published: (2026)

The Closure of LCD-to-GI Reductions via Generalized Inner Products
by: Ishizuka, Keita
Published: (2026)

Intersecting Codes and the Connectivity of $q$-Matroids
by: Conca, Fabrizio, et al.
Published: (2026)

Optimal codes and arcs for the generalized Hamming weights
by: Kurz, Sascha, et al.
Published: (2026)

Error-detecting solid codes
by: Carruth, Nathan Thomas
Published: (2026)

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
by: Zhao, Ziyang, et al.
Published: (2026)

A generalization of Boppana's entropy inequality
by: Ho, Boon Suan
Published: (2026)

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

On the existence of linear rank-metric intersecting codes
by: Borello, Martino, et al.
Published: (2026)