scientific article; zbMATH DE number 431994
From MaRDI portal
Publication:3138754
distancesembeddingsgeometric graphs\(k\)-setsSylvester-Gallai problemfinite point setsunit distancesdimension of graphsErdős-type problemsweavings
Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Graph theory (05C99) Other finite incidence structures (geometric aspects) (51E30)
Recommendations
- scientific article; zbMATH DE number 3975761
- scientific article; zbMATH DE number 815758
- scientific article; zbMATH DE number 3907247
- scientific article; zbMATH DE number 4187465
- Geometria combinatoria e geometrie finite
- Excursions into combinatorial geometry
- scientific article; zbMATH DE number 5838440
- scientific article; zbMATH DE number 4016785
- scientific article; zbMATH DE number 1017008
- Finite geometry and combinatorial applications
Cited in
(11)- A sufficient degree condition for a graph to contain all trees of size \(k\)
- Combinatorial distance geometry in normed spaces
- Ordered and convex geometric trees with linear extremal function
- On fan-wheel and tree-wheel Ramsey numbers
- Recent developments in algebraic combinatorics
- scientific article; zbMATH DE number 7300683 (Why is no real title available?)
- An Erdős-Gallai-type theorem for keyrings
- Dense packings with nonparallel cylinders
- Directions in combinatorial geometry
- The asymptotic behavior of precise lower estimate of reconstruction of a linear order on a finite set
- A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138754)
