On-line Ramsey numbers for paths and stars

On-line Ramsey numbers for paths and stars

Graphs and Algorithms

Bibliographic Details
Main Authors:	J. A. Grytczuk, H. A. Kierstead, P. Prałat
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2008-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/427/pdf

Similar Items

Avoidance colourings for small nonclassical Ramsey numbers
by: Alewyn Petrus Burger, et al.
Published: (2011-07-01)

A note on planar Ramsey numbers for a triangle versus wheels
by: Guofei Zhou, et al.
Published: (2012-11-01)

The competition number of a generalized line graph is at most two
by: Boram Park, et al.
Published: (2012-08-01)

On paths, trails and closed trails in edge-colored graphs
by: Laurent Gourvès, et al.
Published: (2012-09-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

8-star-choosability of a graph with maximum average degree less than 3
by: Min Chen, et al.
Published: (2011-12-01)

On the chromatic number of some flip graphs
by: Ruy Fabila-Monroy, et al.
Published: (2009-01-01)

The b-chromatic number of powers of cycles
by: Anja Kohl
Published: (2013-03-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

Computation of L_⊕ for several cubic Pisot numbers
by: Julien Bernat
Published: (2007-01-01)

Number of connected spanning subgraphs on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)

A lower bound for approximating the Grundy number
by: Guy Kortsarz
Published: (2007-01-01)

On the number of factors in codings of three interval exchange
by: Petr Ambrož, et al.
Published: (2011-11-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

On the number of maximal independent sets in a graph
by: David R. Wood
Published: (2011-09-01)

The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-01-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

A bound on the number of perfect matchings in Klee-graphs
by: Marek Cygan, et al.
Published: (2013-01-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
by: Valerie Berthe, et al.
Published: (2009-03-01)

Computing the number of h-edge spanning forests in complete bipartite graphs
by: Rebecca Stones
Published: (2014-05-01)

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)

On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
by: Nicolas Bédaride, et al.
Published: (2010-01-01)

On-line extensible bin packing with unequal bin sizes
by: Deshi Ye, et al.
Published: (2009-01-01)

A Note on t-designs with t Intersection Numbers
by: Rajendra M. Pawale
Published: (2004-01-01)

The \v Cerný conjecture for aperiodic automata
by: A. N. Trahtman
Published: (2007-01-01)

Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)

Determinants of rational knots
by: Louis H. Kauffman, et al.
Published: (2009-01-01)

Sufficient conditions for labelled 0-1 laws
by: Stanley N. Burris, et al.
Published: (2008-01-01)

Total domination in K₅- and K₆-covered graphs
by: Odile Favaron, et al.
Published: (2008-01-01)

Probe split graphs
by: Van Bang Le, et al.
Published: (2007-01-01)

Immersion containment and connectivity in color-critical graphs
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)

Random Horn formulas and propagation connectivity for directed hypergraphs
by: Robert H. Sloan, et al.
Published: (2012-08-01)

On the k-restricted structure ratio in planar and outerplanar graphs
by: Gruia Călinescu, et al.
Published: (2008-01-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-01-01)

Leftmost derivations of propagating scattered context grammars: a new proof
by: Tomáš Masopust, et al.
Published: (2008-01-01)

Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01)

Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)