Cover Image

New bounds for the optimal density of covering single-insertion codes via the Turán density

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pikhurko, Oleg, Verbitsky, Oleg, Zhukovskii, Maksim
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Canonical labelling of sparse random graphs
by: Verbitsky, Oleg, et al.
Published: (2024)

Gathering Information about a Graph by Counting Walks from a Single Vertex
by: Fuhlbrück, Frank, et al.
Published: (2024)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

On the Expressibility of the Reconstructional Color Refinement
by: Arvind, V., et al.
Published: (2024)

First order complexity of finite random structures
by: Demin, Danila, et al.
Published: (2024)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Bounds on Linear Turán Number for Trees
by: Adak, Rajat, et al.
Published: (2026)

Vertex-Based Localization of Turán's Theorem
by: Adak, Rajat, et al.
Published: (2025)

Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)

Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)

Intervals of hypergraph Turán densities
by: Liu, Xizhi, et al.
Published: (2026)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
by: Char, Arnab, et al.
Published: (2024)

New bounds for proper $h$-conflict-free colourings
by: Chuet, Quentin, et al.
Published: (2025)

Edge densities of drawings of graphs with one forbidden cell
by: Hahn, Benedikt, et al.
Published: (2025)

Non-dissective coverings by planks
by: Kupavskii, Andrey, et al.
Published: (2025)

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

Beyond recognizing well-covered graphs
by: Feghali, Carl, et al.
Published: (2024)

Intersecting families with covering number $3$
by: Kupavskii, Andrey
Published: (2024)

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)

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

An improvement on the bound for the acyclic chromatic index
by: Kirousis, Lefteris, et al.
Published: (2026)

Functionality of Random Graphs
by: Sylvester, John, et al.
Published: (2024)

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

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

A Gray code for arborescences of tournaments
by: Bonamy, Marthe, et al.
Published: (2026)

Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

C sequential optimization numbers
by: Hui, Zile
Published: (2024)