Sciweavers

COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 4 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
COMBINATORICS
2004
61views more  COMBINATORICS 2004»
13 years 4 months ago
Graphic and Protographic Lists of Integers
A positive list (list of positive integers) is protographic if its merger with all but finitely many positive graphic lists is graphic. Define the family Ps of s-protogaphic lists...
Dmitry Fon-Der-Flaass, Douglas B. West
LOGCOM
2007
84views more  LOGCOM 2007»
13 years 4 months ago
A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions
Harvey Friedman introduced natural independence results for the Peano axioms via certain schemes of combinatorial well-foundedness. We consider here parameterized versions of this...
Arnoud den Boer, Andreas Weiermann
JGT
2007
130views more  JGT 2007»
13 years 4 months ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala
JCT
2007
99views more  JCT 2007»
13 years 4 months ago
Independence for partition regular equations
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...
Imre Leader, Paul A. Russell
TCS
2008
13 years 4 months ago
The computational complexity of the parallel knock-out problem
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
Hajo Broersma, Matthew Johnson 0002, Daniël P...
SIAMDM
2008
89views more  SIAMDM 2008»
13 years 4 months ago
Planarity, Colorability, and Minor Games
Let m and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vert...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...
JCT
2006
82views more  JCT 2006»
13 years 4 months ago
On Rado's Boundedness Conjecture
We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We the...
Jacob Fox, Daniel J. Kleitman
JCT
2008
77views more  JCT 2008»
13 years 4 months ago
Counting descent pairs with prescribed tops and bottoms
Given sets X and Y of positive integers and a permutation = 12
John T. Hall, Jeffrey B. Remmel
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
13 years 4 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq