600 search results - page 12 / 120 » Problems and results in extremal combinatorics - II |
COMBINATORICS
2006
13 years 8 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...
COMBINATORICS
2006
13 years 8 months ago
2006
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
FEDCSIS
2011
12 years 7 months ago
2011
—Nowadays, embedded systems are widely used. It is extremely difficult to analyze safety issues in embedded systems, to relate the safety analysis results to the actual parts, a...
COMBINATORICS
2002
13 years 7 months ago
2002
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...