The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Graphs Comb.

• Publication date

  2014-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00373-013-1335-7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Geometric graphs with no two parallel edges

  2008cited by this paper
• On the Maximum Number of Edges in Quasi-Planar Graphs

  2006cited by this paper
• On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

  2006cited by this paper
• Research problems in discrete geometry

  2005cited by this paper
• On the number of directions determined by a three-dimensional points set

  2004cited by this paper
• A tight bound for the number of different directions in three dimensions

  2003cited by this paper
• On Geometric Graphs with No Two Edges in Convex Position

  1998cited by this paper
• On Geometric Graphs with No k Pairwise Parallel Edges

  1997cited by this paper
• Graph Drawings with no k Pairwise Crossing Edges

  1997cited by this paper
• Quasi-planar graphs have a linear number of edges

  1995cited by this paper
• Crossing families

  1991cited by this paper
• Notes on Geometric Graph Theory

  1990cited by this paper

• Extremal problems for pairs of triangles

  2020cites this paper