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

Documenti analoghi

• Canonical labelling of sparse random graphs
  di: Verbitsky, Oleg, et al.
  Pubblicazione: (2024)
• Gathering Information about a Graph by Counting Walks from a Single Vertex
  di: Fuhlbrück, Frank, et al.
  Pubblicazione: (2024)
• First order distinguishability of sparse random graphs
  di: Hershko, Tal, et al.
  Pubblicazione: (2024)
• On the Expressibility of the Reconstructional Color Refinement
  di: Arvind, V., et al.
  Pubblicazione: (2024)
• First order complexity of finite random structures
  di: Demin, Danila, et al.
  Pubblicazione: (2024)