1672 search results - page 45 / 335 » Tightness problems in the plane |
JCT
2007
13 years 8 months ago
2007
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
SIGCOMM
2003
ACM
14 years 2 months ago
2003
ACM
We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as re...
JCT
2011
13 years 3 months ago
2011
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three clas...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— Recently, the acquisition of three-dimensional maps has become more and more popular. This is motivated by the fact that robots act in the three-dimensional world and several t...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3-edge-connected PSLG, then 2n−2 new edges are enou...