#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1989

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lihao Xu, Vasken Bohossian, Jehoshua Bruck, David G. Wagner
- IEEE Trans. Information Theory
- 1999

Abstmct We reveal an equivalence relation between the construction of a new class of low density MDS array codes, that we call B-Code, and a combinatorial problem known as perfect one-factorization of complete graphs. We use known perfect one-factors of complete graphs to create constructions and decoding algorithms for both B-Code and its dual code. B-Code… (More)

- David G. Wagner
- J. Comb. Theory, Ser. A
- 1991

- David G. Wagner
- Combinatorics, Probability & Computing
- 2000

For a finite multigraph G, the reliability function of G is the probability RG(q) that if each edge of G is deleted independently with probability q then the remaining edges of G induce a connected spanning subgraph of G; this is a polynomial function of q. In 1992, Brown and Colbourn conjectured that for any connected multigraph G, if q ∈ C is such that… (More)

- Brian Alspach, Paul J. Schellenberg, Douglas R. Stinson, David G. Wagner
- J. Comb. Theory, Ser. A
- 1989

- Youngbin Choe, David G. Wagner
- Combinatorics, Probability & Computing
- 2006

Motivated by a property of linear resistive electrical networks, we introduce the class of Rayleigh matroids. These form a subclass of the balanced matroids defined by Feder and Mihail [10] in 1992. We prove a variety of results relating Rayleigh matroids to other well–known classes – in particular, we show that a binary matroid is Rayleigh if and only if… (More)

- David G. Wagner
- Eur. J. Comb.
- 1992

- David G. Wagner
- Electr. J. Comb.
- 2005

A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid of rank three satisfies these inequalities.

- Thomas S. Sundquist, David G. Wagner, Julian West
- J. Comb. Theory, Ser. A
- 1997

Let P be a nite partial order which does not contain an induced subposet isomorphic with 3 + 1, and let G be the incomparability graph of P . Gasharov has shown that the chromatic symmetric function XG has nonnegative coe cients when expanded in terms of Schur functions; his proof uses the dual Jacobi-Trudi identity and a sign-reversing involution to… (More)

Univariate polynomials with only real roots, while special, do occur often enough that their properties can lead to interesting conclusions in diverse areas. Due mainly to the recent work of two young mathematicians, Julius Borcea and Petter Brändén, a very successful multivariate generalization of this method has been developed. The first part of this… (More)

- David G. Wagner
- Electr. J. Comb.
- 2005

In 1981, Stanley applied the Aleksandrov–Fenchel Inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a generalization of this for the wider class of matroids with the “half–plane property”. Then we explore a nest of inequalities for weighted basis– generating polynomials that are… (More)