1215 search results - page 132 / 243 » Combinatorics |
126
click to vote
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE RNP no(1)-T (TALLY); (2)NE RSN m (SPARS...
127
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
140
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
128
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
116
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...