The maximum number of edges in geometric graphs with pairwise virtually avoiding edges (Q742617): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-013-1335-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2047512733
@@ Property / OpenAlex ID: W2047512733 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of edges in topological graphs with no four pairwise crossing edges
+Normal rank
@@ Property / cites work @@
+On the maximum number of edges in quasi-planar graphs
+Normal rank
@@ Property / cites work @@
+Quasi-planar graphs have a linear number of edges
@@ Property / cites work: Quasi-planar graphs have a linear number of edges / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing families
@@ Property / cites work: Crossing families / rank @@
+Normal rank
@@ Property / cites work @@
+Research Problems in Discrete Geometry
@@ Property / cites work: Research Problems in Discrete Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+On geometric graphs with no two edges in convex position
+Normal rank
@@ Property / cites work @@
+On the number of directions determined by a three-dimensional points set
+Normal rank
@@ Property / cites work @@
+Geometric graphs with no two parallel edges
@@ Property / cites work: Geometric graphs with no two parallel edges / rank @@
+Normal rank
@@ Property / cites work @@
+On geometric graphs with no \(k\) pairwise parallel edges
+Normal rank