Sciweavers

347 search results - page 14 / 70
» Schaefer's theorem for graphs
Sort
View
COMBINATORICA
2011
13 years 9 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
JCT
2008
81views more  JCT 2008»
14 years 9 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
COMBINATORICS
2004
100views more  COMBINATORICS 2004»
14 years 9 months ago
Lattice Structures from Planar Graphs
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
Stefan Felsner
SIAMDM
2008
86views more  SIAMDM 2008»
14 years 9 months ago
Hamilton Cycles in Planar Locally Finite Graphs
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
Henning Bruhn, Xingxing Yu
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
14 years 9 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira