#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1999

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Woong Kook, Victor Reiner, Dennis Stanton
- J. Comb. Theory, Ser. B
- 1999

Let M be a finite matroid with rank function r. We will write A ⊆ M when we mean that A is a subset of the ground set of M , and write M | A and M/A for the matroids obtained by restricting M to A, and contracting M on A respectively. Let M * denote the dual matroid to M. (See [1] for definitions). The main theorem is Theorem 1. The Tutte polynomial T M (x,… (More)

- Seung Kyoon Shin, Woong Kook
- Decision Support Systems
- 2014

- Woong Kook
- 2006

A real polynomial is called log-concave if its coefficients form a log-concave sequence. We give a new elementary proof of the fact that a product of log-concave polynomials with nonnegative coefficients and no internal zero coefficients is again log-concave. In addition, we show that if the coefficients of the polynomial m∈M (x + m) form a monotone… (More)

- Woong Kook, Kang-Ju Lee
- Eur. J. Comb.
- 2016

- MICHAEL E. M. KRUL, Luboš Thoma, Woong Kook, Edmund Lamagna, Nasser H. Zawia
- 2013

2013 ABSTRACT A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edge is completely colored by one color. In 2008 Hillar and Windfeldt gave a complete characterization of the k-colorability of graphs through algebraic methods. We generalize their work and give a complete algebraic characterization of the… (More)

- Woong Kook
- Appl. Math. Lett.
- 2011

- Seung Kyoon Shin, Woong Kook
- HICSS
- 2010

This is a bibliography to accompany the slides from my talk at In general, a reference in the slides with a name and date has an obvious unique corresponding entry in the bibliography. There are two places where there might be some confusion. There are two articles written by Merris from 1994 (in addition to the article he cowrote with Grone, also in… (More)

- Woong Kook
- Eur. J. Comb.
- 2012

- Woong Kook
- Eur. J. Comb.
- 2007

The conê G of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the reduced homology of the independent set complex of the cycle matroid ofˆG is the cardinality of the set of the edge-rooted forests in the base graph G. We also show that there is a basis… (More)