Sciweavers

300 search results - page 7 / 60
» Extension of a theorem of Whitney
Sort
View
COMBINATORICS
2002
88views more  COMBINATORICS 2002»
13 years 7 months ago
Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
Michael O. Albertson, Joan P. Hutchinson
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
14 years 1 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
13 years 7 months ago
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...
Lutz Volkmann
COMBINATORICA
2004
97views more  COMBINATORICA 2004»
13 years 7 months ago
Partition Theorems for Left and Right Variable Words
In 1984 T. Carlson and S. Simpson established an infinitary extension of the Hales-Jewett Theorem in which the leftmost letters of all but one of the words were required to be vari...
Neil Hindman, Randall McCutcheon
JSC
2000
60views more  JSC 2000»
13 years 7 months ago
Generic Extensions and Generic Polynomials
This paper presents a generalization of a theorem of Saltman on the existence of generic extensions with group A G over an infinite field K, where A is abelian, using less restri...
Arne Ledet