Hamiltonian paths in distance graphs

DOI10.1134/S0001434615050260zbMath1322.05081MaRDI QIDQ745636

V. V. Utkin

Publication date: 14 October 2015

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

hypergraphdistance graphcliqueHamiltonian pathsimple path

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• Distance graphs with large chromatic numbers and small clique numbers
• New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
• Around Borsuk's hypothesis
• Excursions into combinatorial geometry
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• Coloring some finite sets in {R}^{n}
• Research Problems in Discrete Geometry
• The problems of Borsuk and Grunbaum on lattice polytopes
• The Mathematical Coloring Book
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs