- Erika R. Kovács, László A. Végh. The constructive characterization of (::::κ, ℓ::::)-edge-connected digraphs. Combinatorica, 31(2):201-223, 2011.
- Richard P. Anstee, Balin Fleming. Linear algebra methods for forbidden configurations. Combinatorica, 31(1):1-19, 2011.
- József Balogh, Wojciech Samotij. The number of ::::K::::::::::m, m::::::-free graphs. Combinatorica, 31(2):131-150, 2011.
- Eli Berger, Henning Bruhn. Eulerian edge sets in locally finite graphs. Combinatorica, 31(1):21-38, 2011.
- Domingos Dellamonica Jr., Vojtech Rödl. Hereditary quasirandom properties of hypergraphs. Combinatorica, 31(2):165-182, 2011.
- Pierre Gillibert, Friedrich Wehrung. An infinite combinatorial statement with a poset parameter. Combinatorica, 31(2):183-200, 2011.
- Anders Björner. A ::::q::::-analogue of the FKG inequality and some applications. Combinatorica, 31(2):151-164, 2011.
- Molly Dunkum, Peter Hamburger, Attila Pór. Destroying cycles in digraphs. Combinatorica, 31(1):55-66, 2011.
- Saharon Shelah, Jindrich Zapletal. Ramsey theorems for product of finite sets with submeasures. Combinatorica, 31(2):225-244, 2011.
- Andrzej Dudek, Vojtech Rödl. On ::::K::::::::::s::::::-free subgraphs in ::::K::::::::::s::::+::::k::::::-free graphs and vertex Folkman numbers. Combinatorica, 31(1):39-53, 2011.