#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2012

2015

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

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Shagnik Das, Wenying Gan, Benny Sudakov
- Combinatorica
- 2013

Let F be a set system on [n] with all sets having k elements and every pair of sets intersecting. The celebrated theorem of Erdős, Ko and Rado from 1961 says that, provided n ≥ 2k, any such system… (More)

- Wenying Gan, Po-Shen Loh, Benny Sudakov
- Combinatorics, Probability & Computing
- 2015

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Engbers and Galvin asked how large $i_t(G)$ could be in graphs with minimum degree at least $\delta$. They further… (More)

- Shagnik Das, Wenying Gan, Benny Sudakov
- Combinatorics, Probability & Computing
- 2013

A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives the size of the largest family of subsets of [n] not containing a 2-chain F1 ⊂ F2. Erdýos extended… (More)

- Wenying Gan, Dániel Korándi, Benny Sudakov
- Eur. J. Comb.
- 2014

An $n$-by-$n$ bipartite graph is $H$-saturated if the addition of any missing edge between its two parts creates a new copy of $H$. In 1964, Erd\H{o}s, Hajnal and Moon made a conjecture on the… (More)

A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives the size of the largest family of subsets of [n] not containing a 2-chain. Erdos extended this… (More)

The optimal power flow problem is concerned with finding a proper operating point for a power network while attempting to minimize some cost function and satisfy several network constraints. In this… (More)

- Baha Alzalg, Catalina Anghel, +4 authors Chai Wah Wu
- IEEE International Symposium on Circuits and…
- 2012

The optimal power flow problem is concerned with finding a proper operating point for a power network while attempting to minimize a cost function and satisfy network constraints. We analyze the… (More)

- Wenying Gan
- 2014

Author(s): Gan, Wenying | Advisor(s): Sudakov, Benjamin | Abstract: Extremal combinatorics is one of the central branches of discrete mathematics. It focuses on determining or estimating the optimal… (More)

- ‹
- 1
- ›