#### Filter Results:

#### Publication Year

2001

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Fix two lattice paths P and Q from ð0; 0Þ to ðm; rÞ that use East and North steps with P never going above Q: We show that the lattice paths that go from ð0; 0Þ to ðm; rÞ and that remain in the region bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call a lattice path matroid. We consider a variety… (More)

We give a correspondence between graphs with a given degree sequence and fillings of Ferrers diagrams by nonnegative integers with prescribed row and column sums. In this setting, k-crossings and k-nestings of the graph become occurrences of the identity and the antiidentity matrices in the filling. We use this to show the equality of the numbers of… (More)

We prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d-edge-connected graph, then H is the line graph of a d-regular graph. Using this result we prove that the line graph of a regular complete t-partite graph is uniquely determined by its Tutte polynomial. We prove the same result for the line graph of any complete… (More)

This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One of the main results is a characterization of lattice path matroids in terms of fundamental flats, which are special… (More)

We present a complete solution to the so-called tennis ball problem, which is equivalent to counting lattice paths in the plane that use North and East steps and lie between certain boundaries. The solution takes the form of explicit expressions for the corresponding generating functions. Our method is based on the properties of Tutte polynomials of… (More)

We solve in the affirmative a conjecture of Brylawski, namely that the Tutte polynomial of a connected matroid is irreducible over the integers. If M is a matroid over a set E, then its Tutte polynomial is defined as T(M; x, y)= C A ı E (x − 1) r(E) − r(A) (y − 1) | A | − r(A) , where r(A) is the rank of A in M. This polynomial is an important invariant as… (More)

This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncrossing 2-nonnesting graphs as k-nonnesting 2-noncrossing graphs. This class consists of the graphs on [n] where each vertex x is joined to at most one vertex y with y < x. On the… (More)