1215 search results - page 62 / 243 » Combinatorics |
100
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
For n a positive integer, we show that the number of of 2n-tuples of integers that are the row and column sums of some n
115
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...
COMBINATORICS
2007
15 years 3 months ago
2007
In this paper, we derive an interesting identity from the Rogers-Fine identity by applying the q-exponential operator method.
COMBINATORICS
2007
15 years 3 months ago
2007
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+ √ 2δ−1 2 . If δ ≥ 1/2 then G has a ρ0n -regular spanning subgraph. The statement is...
109
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial iden...