Imagen de Portada

On multiplicities of interpoint distances

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Clemen, Felix Christian, Dumitrescu, Adrian, Liu, Dingyuan
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On a Traveling Salesman Problem for Points in the Unit Cube
por: Balogh, József, et al.
Publicado: (2023)

Geometric Variants of the Gale--Berlekamp Switching Game
por: Dumitrescu, Adrian
Publicado: (2024)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
por: Dumitrescu, Adrian, et al.
Publicado: (2024)

Covering Complete Geometric Graphs by Monotone Paths
por: Dumitrescu, Adrian, et al.
Publicado: (2025)

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

Arcs with increasing chords in $\mathbf{R}^d$
por: Dumitrescu, Adrian, et al.
Publicado: (2025)

A note on distance-hereditary graphs whose complement is also distance-hereditary
por: Jacob, Hugo
Publicado: (2025)

Isomorphisms of unit distance graphs of layers
por: Bikeev, Arthur Igorevich
Publicado: (2025)

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

A note on the distinct distances problem over finite fields
por: Brukhim, Nataly, et al.
Publicado: (2025)

Upper bounds on the average edit distance between two random strings
por: Rosenfeld, Matthieu
Publicado: (2024)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
por: La, Hoang, et al.
Publicado: (2021)

Rado's covering problem for cubes and balls: a semi-survey
por: Dall'Ara, Gian Maria, et al.
Publicado: (2026)

Bounding the chromatic number of dense digraphs by arc neighborhoods
por: Klingelhoefer, Felix, et al.
Publicado: (2023)

The number of regular simplices in higher dimensions
por: Clemen, Felix Christian, et al.
Publicado: (2025)

Sufficient conditions for perfect mixed tilings
por: Hurley, Eoin, et al.
Publicado: (2022)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
por: Arras, Patrick, et al.
Publicado: (2024)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
por: la Tour, Max Dupré, et al.
Publicado: (2024)

Biclique immersions in graphs with independence number 2
por: Botler, Fábio, et al.
Publicado: (2023)

Toward Grünbaum's Conjecture
por: Ortlieb, Christian, et al.
Publicado: (2024)

Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
por: Ortlieb, Christian, et al.
Publicado: (2024)

Disproving two conjectures on the Hamiltonicity of Venn diagrams
por: Brenner, Sofia, et al.
Publicado: (2025)

Diverse beam search to find densest-known planar unit distance graphs
por: Engel, Peter, et al.
Publicado: (2024)

Packing Topological Minors Half-Integrally
por: Liu, Chun-Hung
Publicado: (2017)

Equitable coloring of sparse graphs
por: Liu, Weichan, et al.
Publicado: (2024)

The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
por: Liu, Yasong, et al.
Publicado: (2024)

Independent transversal blow-up of graphs
por: Dai, Tianjiao, et al.
Publicado: (2025)

Sparser Abelian High Dimensional Expanders
por: Dikstein, Yotam, et al.
Publicado: (2024)

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

Bounds on treewidth via excluding disjoint unions of cycles
por: Hatzel, Meike, et al.
Publicado: (2025)

Well-mixing vertices and almost expanders
por: Chakraborti, Debsoumya, et al.
Publicado: (2021)

Monitoring the edges of product networks using distances
por: Li, Wen, et al.
Publicado: (2022)

Perturbation results for distance-edge-monitoring numbers
por: Yang, Chenxu, et al.
Publicado: (2023)

Quasi-linear distance query reconstruction for graphs of bounded treelength
por: Bastide, Paul, et al.
Publicado: (2024)

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

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

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

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

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

Self-Orthogonal Cellular Automata
por: Mariot, Luca, et al.
Publicado: (2025)