Sciweavers

DAM
2011
13 years 5 months ago
Weak sense of direction labelings and graph embeddings
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
Christine T. Cheng, Ichiro Suzuki
JCT
2010
114views more  JCT 2010»
13 years 9 months ago
An almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Andrzej Dudek, Vojtech Rödl
DAM
2000
97views more  DAM 2000»
13 years 10 months ago
Algorithms and obstructions for linear-width and related search parameters
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
Dimitrios M. Thilikos
ENDM
2007
85views more  ENDM 2007»
13 years 10 months ago
Fast winning strategies in positional games
For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...
DM
2007
116views more  DM 2007»
13 years 10 months ago
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. ...
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 11 months ago
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
Vikraman Arvind, Christine T. Cheng, Nikhil R. Dev...
EJC
2006
13 years 11 months ago
A note on Ramsey numbers with two parameters
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
Yi Ru Huang, Jian Sheng Yang, Kemin Zhang
ENDM
2008
82views more  ENDM 2008»
13 years 11 months ago
Finding Folkman Numbers via MAX CUT Problem
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
Andrzej Dudek, Vojtech Rödl
APPROX
2004
Springer
129views Algorithms» more  APPROX 2004»
14 years 4 months ago
The Chromatic Number of Random Regular Graphs
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
Dimitris Achlioptas, Cristopher Moore
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 11 months ago
The two possible values of the chromatic number of a random graph
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.
Dimitris Achlioptas, Assaf Naor