default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 30
Volume 30, Number 1, January 2010
- Ada Chan, Chris D. Godsil
:
Type-II matrices and combinatorial structures. 1-24 - Stefaan De Winter, Jeroen Schillewaert:
Characterizations of finite classical polar spaces by intersection numbers with hyperplanes and spaces of codimension 2. 25-45 - Venkatesan Guruswami, James R. Lee, Alexander A. Razborov:
Almost Euclidean subspaces of l 1N VIA expander codes. 47-68 - Bill Jackson:
An inequality for Tutte polynomials. 69-81 - Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer:
Partition properties of the dense local order and a colored version of Milliken's theorem. 83-104 - Martin Marciniszyn, Reto Spöhel:
Online vertex-coloring games in random graphs. 105-123
Volume 30, Number 2, March 2010
- Péter Csikvári:
On a poset of trees. 125-137 - Cécile Dartyge, András Sárközy, Mihály Szalay:
On the pseudo-randomness of subsets related to primitive roots. 139-162 - Katalin Gyarmati, Máté Matolcsi, Imre Z. Ruzsa:
A superadditivity and submultiplicativity property for cardinalities of sumsets. 163-174 - Peter Keevash, Dhruv Mubayi:
Set systems without a simplex or a cluster. 175-200 - Henry A. Kierstead, Alexandr V. Kostochka:
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. 201-216 - Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi:
A fast algorithm for equitable coloring. 217-224 - Van H. Vu:
Structure of large incomplete sets in abelian groups. 225-237 - Raphael Yuster:
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. 239-246 - Satoru Fujishige:
A note on disjoint arborescences. 247-252 - Guo-Niu Han:
New hook length formulas for binary trees. 253-256
Volume 30, Number 3, May 2010
- Ronnie Barequet, Gill Barequet, Günter Rote:
Formulae and growth rates of high-dimensional polycubes. 257-275 - Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko:
Hypergraphs with independent neighborhoods. 277-293 - Hiroshi Hirai:
Metric packing for K3+K3. 295-326 - Ryan O'Donnell, Rocco A. Servedio:
New degree bounds for polynomial threshold functions. 327-358
Volume 30, Number 4, July 2010
- George Androulakis, Stephen J. Dilworth, Nigel J. Kalton:
A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces. 359-385 - Maria Chudnovsky, Paul D. Seymour:
The three-in-a-tree problem. 387-417 - Shawn Hedman, Wai Yan Pong:
Locally finite homogeneous graphs. 419-434 - Ernest E. Shult, Koen Thas:
A theorem of Cohen on parapolar spaces. 435-444 - Benny Sudakov, Jan Vondrák:
A randomized embedding algorithm for trees. 445-470 - Rade T. Zivaljevic:
Oriented matroids and Ky Fan's theorem. 471-484
Volume 30, Number 5, September 2010
- Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang:
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. 485-520 - Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. 521-532 - Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar:
Approximation algorithms via contraction decomposition. 533-552 - Gábor Elek:
On the limit of large girth graph sequences. 553-563 - Shinya Fujita, Ken-ichi Kawarabayashi:
Non-separating even cycles in highly connected graphs. 565-580 - Manor Mendel, Assaf Naor:
Maximum gradient embeddings and monotone clustering. 581-615
Volume 30, Number 6, November 2010
- Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner:
The generalized almost resolvable cycle system problem. 617-625 - Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On properties of random dissections and triangulations. 627-654 - E. Rodney Canfield, Brendan D. McKay:
Asymptotic enumeration of integer matrices with large equal row and column sums. 655-680 - Reinhard Diestel, Philipp Sprüssel:
The homology of a locally finite graph with ends. 681-714 - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Algorithms for finding an induced cycle in planar graphs. 715-734 - Torsten Korneffel, Eberhard Triesch:
An asymptotic bound for the complexity of monotone graph properties. 735-743
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-12-04 22:09 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:
