Sciweavers

1132 search results - page 58 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
COMGEO
2007
ACM
14 years 12 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood
DCC
2008
IEEE
15 years 11 months ago
Partial ovoids and partial spreads in hermitian polar spaces
We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal part...
Jan De Beule, Andreas Klein, Klaus Metsch, Leo Sto...
COMPGEOM
2010
ACM
15 years 5 months ago
Improving the first selection lemma in R3
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
JCT
2007
90views more  JCT 2007»
14 years 11 months ago
On the maximum number of edges in quasi-planar graphs
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Eyal Ackerman, Gábor Tardos
ICALP
2005
Springer
15 years 5 months ago
Online Interval Coloring and Variants
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
Leah Epstein, Meital Levy