Sciweavers

229 search results - page 2 / 46
» On the Number of Arrangements of Pseudolines
Sort
View
ENDM
2008
101views more  ENDM 2008»
13 years 4 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
DAM
2006
124views more  DAM 2006»
13 years 4 months ago
Coloring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
Walter Morris
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 4 months ago
Cubic Partial Cubes from Simplicial Arrangements
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families...
David Eppstein
JGAA
2010
128views more  JGAA 2010»
13 years 3 months ago
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...