default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 31
Volume 31, Number 1, January 2011
- Richard P. Anstee, Balin Fleming:
Linear algebra methods for forbidden configurations. 1-19 - Eli Berger, Henning Bruhn:
Eulerian edge sets in locally finite graphs. 21-38 - Andrzej Dudek, Vojtech Rödl:
On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers. 39-53 - Molly W. Dunkum
, Peter Hamburger, Attila Pór:
Destroying cycles in digraphs. 55-66 - Hongze Li, Hao Pan:
Monochromatic integers adding to polynomials of prime variables. 67-83 - Edward Marchant, Andrew Thomason:
The structure of hereditary properties and 2-coloured multigraphs. 85-93 - Paul Wollan:
Packing cycles with modularity constraints. 95-126 - David Brink:
Chevalley's theorem with restricted variables. 127-130
Volume 31, Number 2, March 2011
- József Balogh, Wojciech Samotij:
The number of Km, m-free graphs. 131-150 - Anders Björner:
A q-analogue of the FKG inequality and some applications. 151-164 - Domingos Dellamonica Jr., Vojtech Rödl:
Hereditary quasirandom properties of hypergraphs. 165-182 - Pierre Gillibert, Friedrich Wehrung:
An infinite combinatorial statement with a poset parameter. 183-200 - Erika R. Kovács, László A. Végh:
The constructive characterization of (κ, ℓ)-edge-connected digraphs. 201-223 - Saharon Shelah, Jindrich Zapletal:
Ramsey theorems for product of finite sets with submeasures. 225-244 - Amir Yehudayoff:
Affine extractors over prime fields. 245-256
Volume 31, Number 3, May 2011
- Daniela A. Amato, John Kenneth Truss:
Some constructions of highly arc-transitive digraphs. 257-283 - Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans:
Binary subtrees with few labeled paths. 285-303 - Zeev Dvir, Amir Shpilka:
Towards dimension expanders over finite fields. 305-320 - Alexander Engström:
A local criterion for Tverberg graphs. 321-332 - Zohar Shay Karnin, Amir Shpilka:
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. 333-364 - R. Bruce Richter, Brendan Rooney, Carsten Thomassen:
On planarity of compact, locally connected, metric spaces. 365-376 - Simeon Ball, Oriol Serra:
Erratum to: Punctured Combinatorial Nullstellensätze. 377-378
Volume 31, Number 4, November 2011
- Shahar Dobzinski, Noam Nisan:
Limitations of VCG-based mechanisms. 379-396 - Bertrand Guenin, Robin Thomas:
Packing directed circuits exactly. 397-421 - Colin McDiarmid, Tobias Müller:
On the chromatic number of random geometric graphs. 423-488 - Ákos Seress, Tsai-Lien Wong, Xuding Zhu:
Distinguishing labeling of the actions of almost simple groups. 489-506
Volume 31, Number 5, November 2011
- Darryn E. Bryant, Melinda Buchanan, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin:
On the non-existence of pair covering designs with at least as many points as blocks. 507-528 - Svante Janson:
Poset limits and exchangeable random posets. 529-563 - Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald:
On the threshold for k-regular subgraphs of random graphs. 565-581 - Alexander A. Sherstov:
The unbounded-error communication complexity of symmetric functions. 583-614 - Joseph A. Thas, Hendrik Van Maldeghem:
Generalized Veronesean embeddings of projective spaces. 615-629
Volume 31, Number 6, December 2011
- Jørgen Bang-Jensen, Matthias Kriesell:
On the problem of finding disjoint cycles and dicycles in a digraph. 639-668 - Jonathan Browder, Isabella Novik:
Face numbers of generalized balanced Cohen-Macaulay complexes. 669-689 - Yong-Gao Chen, Jin-Hui Fang:
On a problem of Cilleruelo and Nathanson. 691-696 - Jin-Hui Fang:
A characterization of the identity function with equation f(p+q+r)=f(p)+f(q)+f(r). 697-701 - Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer:
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. 703-723 - Hiroshi Nozaki:
Inside S-inner product sets and Euclidean designs. 725-737 - Tamás Terpai:
Proof of a conjecture of V. Nikiforov. 739-754
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-04 00:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
