DM 2011 | Sciweavers

24

DM
2011

238views Education» more DM 2011»

A combinatorial approach to height sequences in finite partially ordered sets

13 years 2 months ago

Fix an element x of a ﬁnite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...

Csaba Biró, William T. Trotter

claim paper

Read More »

19

click to vote

DM
2011

188views Education» more DM 2011»

Singletons and adjacencies of set partitions of type B

13 years 2 months ago

Download www.billchen.org

We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zero-block, in analo...

William Y. C. Chen, David G. L. Wang

claim paper

Read More »

20

click to vote

DM
2011

192views Education» more DM 2011»

Loose Hamilton cycles in hypergraphs

13 years 2 months ago

Download www.maths.qmul.ac.uk

We prove that any k-uniform hypergraph on n vertices with minimum degree at least n 2(k−1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K...

Peter Keevash, Daniela Kühn, Richard Mycroft,...

claim paper

Read More »

20

click to vote

DM
2011

253views Education» more DM 2011»

On the hyperbolicity constant in graphs

13 years 2 months ago

Download gama.uc3m.es

If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...

José M. Rodríguez, Jose Maria Sigarr...

claim paper

Read More »

22

click to vote

DM
2011

154views Education» more DM 2011»

Hall-Littlewood polynomials, alcove walks, and fillings of Young diagrams

13 years 2 months ago