The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
From MaRDI portal
(Redirected from Publication:742617)
Recommendations
- Discrete and Computational Geometry
- On the number of edges in maximally linkless graphs
- scientific article; zbMATH DE number 741200
- On the maximum number of edges in a hypergraph with given matching number
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Maximum number of edges in connected graphs with a given domination number
- scientific article; zbMATH DE number 721636
- On geometric graphs with no k pairwise parallel edges
- On the number of edges in geometric graphs without empty triangles
Cites work
- Crossing families
- Geometric graphs with no two parallel edges
- On geometric graphs with no k pairwise parallel edges
- On geometric graphs with no two edges in convex position
- On the maximum number of edges in quasi-planar graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- On the number of directions determined by a three-dimensional points set
- Quasi-planar graphs have a linear number of edges
- Research Problems in Discrete Geometry
Cited in
(6)- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges
- Extremal problems for pairs of triangles
- On the number of edges in geometric graphs without empty triangles
- On the light side of geometric graphs
- Discrete and Computational Geometry
This page was built for publication: The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742617)
