A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

MaRDI QIDQ6621192

Jan Hladký, Jan Kolář, Václav Vlasák, Martin Doležal, Christos Pelekis, Themis Mitsis

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance geometry (51K99) Distance in graphs (05C12) Infinite graphs (05C63)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Turán type results for distance graphs
• Eine Extremalaufgabe aus der Graphentheorie.
• Measure Graphs
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

This page was built for publication: A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621192)