347 search results - page 33 / 70 » Schaefer's theorem for graphs |
SIAMCO
2008
15 years 1 months ago
2008
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theore...
130
click to vote
COMBINATORICS
1998
15 years 1 months ago
1998
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
108
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
ARSCOM
2007
15 years 1 months ago
2007
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
121
click to vote
DM
2008
15 years 1 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...