Uppaluri S. R. Murty

Ear Decompositions of Matching Covered Graphs

G different from and has at least Δ edge-disjoint removable ears, where Δ is the maximum degree of G. This shows that any matching covered graph G has at least Δ! different ear decompositions, and thus is a generalization of the fundamental theorem of Lovász and Plummer establishing the existence of ear decompositions. We also show that every brick G different from and has Δ− 2 edges, each of which is a removable edge in G, that is, an edge whose deletion from G results in a matching covered graph. This generalizes a well-known theorem of Lovász. We also give a simple proof of another theorem due to Lovász which says that every nonbipartite matching covered graph has a canonical ear decomposition, that is, one in which either the third graph in the sequence is an odd-subdivision of or the fourth graph in the sequence is an odd-subdivision of . Our method in fact shows that every nonbipartite matching covered graph has a canonical ear decomposition which is optimal, that is one which has as few double ears as possible. Most of these results appear in the Ph. D. thesis of the first author [1], written under the supervision of the second author.

On a Conjecture of Lovász Concerning Bricks

In 1987, Lovasz conjectured that every brick G different from K4, C6, and the Petersen graph has an edge e such that G?e is a matching covered graph with exactly one brick. Lovasz and Vempala announced a proof of this conjecture in 1994. Their paper is under preparation. In this paper and its sequel (2001, J. Combin. Theory. Ser. B) we present a proof of this conjecture. We shall in fact prove that if G is a brick different from K4, C6, R8 that does not have the Petersen graph as its underlying simple graph, then it has two edges e and f such that both G?e and G?f are matching covered graphs with exactly one brick, with the additional property that, in each case, the underlying simple graph of that one brick is different from the Petersen graph. A cut C of a matching covered graph G is a separating cut if the two C -contractions of G are matching covered. In this paper, we introduce the notion of the characteristic of a separating cut in a matching covered graph and establish some basic properties. We use those properties to first prove our theorem for solid bricks, that is, bricks which do not have any nontrivial separating cuts. The proof of the theorem for nonsolid bricks will be presented in the sequel.

On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic

Abstract In (2001, J. Combin. Theory Ser. B ) we established the validity of the main theorem (1.1) for solid bricks. Here, we establish the existence of suitable separating cuts in nonsolid bricks and prove the theorem by applying induction to cut-contractions with respect to such cuts.

The perfect matching polytope and solid bricks

The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of perfect matchings of G. Edmonds (J. Res. Nat. Bur. Standards Sect. B 69B 1965 125) showed that a vector x in QE belongs to the perfect matching polytope of G if and only if it satisfies the inequalities: (i) x ≥ 0 (non-negativity), (ii) x(∂(v)) = 1, for all v ∈ V (degree constraints) and Off) x(∂(S)) ≥ 1, for all odd subsets S of V (odd set constraints). In this paper, we characterize graphs whose perfect matching polytopes are determined by non-negativity and the degree constraints. We also present a proof of a recent theorem of Reed and Wakabayashi.

The Matching Lattice

A set M of edges of a graph G is a matching of G if each vertex of G is incident with at most one edge of M and a perfect matching of G if each vertex of G is incident with precisely one edge of M.

Matrices with forbidden subconfigurations

Abstract We consider matrices with entries from the set {0, 1, …, q −1}. Suppose that S k is a k × q k matrix having all possible k -tuples as columns. We determine the best possible bound f ( m , k ) with the property that if A is any m ×( f ( m , k )+1) matrix of distinct columns, then some row and column permutation of A contains S k as a submatrix. Our result generalizes a number of the results for q = 2 due to Anstee, Furedi, Quinn, Sauer, Perles and Shelah, and is obtained by means of a simple inductive argument. Interesting matrices meeting the bound are constructed.

On the Number of Perfect Matchings in a Bipartite Graph

In this paper we show that, with 11 exceptions, any matching covered bipartite graph on

How to build a brick

n

Extremal critically connected matroids

vertices, with minimum degree greater than two, has at least

Graphs with independent perfect matchings

2n-4