Sciweavers

7840 search results - page 20 / 1568
» On generalized Ramsey numbers
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
DM
2000
82views more  DM 2000»
13 years 7 months ago
On special numberings of hypergraphs
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple
Günter Schaar
COMGEO
2004
ACM
13 years 7 months ago
A lower bound on the number of triangulations of planar point sets
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
Oswin Aichholzer, Ferran Hurtado, Marc Noy
JCT
2011
93views more  JCT 2011»
12 years 10 months ago
A graph-theoretic approach to quasigroup cycle numbers
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
Brent Kerby, Jonathan D. H. Smith
CP
2009
Springer
14 years 8 months ago
A Constraint on the Number of Distinct Vectors with Application to Localization
Abstract. This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called n...
Gilles Chabert, Luc Jaulin, Xavier Lorca