Search Constraints

Filtering by: Subject Crossing number Remove constraint Subject: Crossing number

Search Results

  • Work
    Article
    Saumell, Maria
    Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, n . . .
  • Work
    Article
    Fernandez, Silvia
    We give a new upper bound for the rectilinear crossing number of the complete geometric graph . We prove that by means of a new construction based on an iterative duplication strategy starting with a set having a certain structure of halving lines.
  • Work
    Article
    Sacristán, Vera
    Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, n . . .
  • Work
    Article
    Salazar, Gelasio
    The Harary–Hill Conjecture states that the number of crossings in any drawing of the complete graph KnKn in the plane is at least Z(n):=14⌊n2⌋⌊n−12⌋⌊n−22⌋⌊n−32⌋Z(n):=14⌊n2⌋⌊n−12⌋⌊n−22⌋⌊n−32⌋. In this paper, we settle the Harary–Hill conjecture for she . . .