136 search results - page 18 / 28 » About Duval's Conjecture |
JCT
2008
13 years 7 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
DM
1998
13 years 7 months ago
1998
We give a counterexample to a conjecture by Wild about binary matroids. We connect two equivalent lines of research in matroid theory: a simple type of basis-exchange property and ...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
ICSE
1993
IEEE-ACM
13 years 11 months ago
1993
IEEE-ACM
Features are often the basic unit of development for a very large software systems and represent long-term efforts, spanning up to several years from inception to actual use. Deve...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...