178 search results - page 7 / 36 » combinatorics 2007 |
COMBINATORICS
2007
15 years 1 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...
COMBINATORICS
2007
15 years 1 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 1 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
91
Voted
EJC
2010
15 years 1 months ago
2010
Most of these problems were presented at the conference on Combinatorics, Geometry and Computer Science, held at CIRM, Luminy, 2-4 May 2007. I have added one problem on a similar ...
ENDM
2007
15 years 1 months ago
2007