Sciweavers

EJC
2008
13 years 5 months ago
Fractional coloring and the odd Hadwiger's conjecture
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
Ken-ichi Kawarabayashi, Bruce A. Reed
DAM
2008
101views more  DAM 2008»
13 years 5 months ago
Degree constrained subgraphs
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16...
Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
13 years 5 months ago
Cyclic orders: Equivalence and duality
Cyclic orders of graphs and their equivalence have been promoted by Bessy and Thomass
Pierre Charbit, András Sebö
AMC
2010
139views more  AMC 2010»
13 years 5 months ago
A conjecture on the stability of the periodic solutions of Ricker's equation with periodic parameters
In this work we propose a conjecture about the stability of the periodic solutions of the Ricker equation with periodic parameters, which goes beyond the existing theory, and for ...
Robert J. Sacker, Hubertus F. von Bremen
FSTTCS
2008
Springer
13 years 6 months ago
Sound Lemma Generation for Proving Inductive Validity of Equations
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
Takahito Aoto
STACS
2000
Springer
13 years 9 months ago
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
Yair Bartal, Elias Koutsoupias
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
13 years 9 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
ANTS
2006
Springer
99views Algorithms» more  ANTS 2006»
13 years 9 months ago
The Asymptotics of Points of Bounded Height on Diagonal Cubic and Quartic Threefolds
For the families ax4 = by4 +z4 +v4 +w4 , a, b = 1, . . . , 100, and ax3 = by3 + z3 + v3 + w3 , a, b = 1, . . . , 100, of projective algebraic threefolds, we test numerically the co...
Andreas-Stephan Elsenhans, Jörg Jahnel
LICS
1999
IEEE
13 years 9 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
COCOON
2003
Springer
13 years 10 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...