Sciweavers

481 search results - page 21 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
CPC
2008
51views more  CPC 2008»
13 years 8 months ago
Winning Fast in Sparse Graph Construction Games
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
Ohad N. Feldheim, Michael Krivelevich
COMGEO
2011
ACM
13 years 3 months ago
On crossing numbers of geometric proximity graphs
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 prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 6 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
ENDM
2007
96views more  ENDM 2007»
13 years 8 months ago
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
Jacob Fox, Veselin Jungic, Rados Radoicic
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 6 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...