Sciweavers

ENDM
2007
89views more  ENDM 2007»
14 years 7 days ago
Nonrepetitive colorings of graphs
Sebastian Czerwinski, Jaroslaw Grytczuk
ENDM
2007
64views more  ENDM 2007»
14 years 12 days ago
Some extensions of the Cauchy-Davenport theorem
Shalom Eliahou, Michel Kervaire
ENDM
2007
64views more  ENDM 2007»
14 years 12 days ago
The complexity of the Weight Problem for permutation groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this pa...
Peter J. Cameron, Taoyang Wu
ENDM
2007
100views more  ENDM 2007»
14 years 12 days ago
Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
Sanming Zhou
ENDM
2007
96views more  ENDM 2007»
14 years 12 days 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
ENDM
2007
81views more  ENDM 2007»
14 years 12 days ago
Kernel perfect and critical kernel imperfect digraphs structure
Hortensia Galeana-Sánchez, Mucuy-kak Guevar...
ENDM
2007
91views more  ENDM 2007»
14 years 12 days ago
On facets of stable set polytopes of claw-free graphs with stability number three
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
Arnaud Pêcher, Pierre Pesneau, Annegret Wagl...