default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 33
Volume 33, Number 1, February 2013
- Alexander I. Barvinok:
A bound for the number of vertices of a polytope with applications. 1-10 - Joshua Browning, Douglas S. Stones, Ian M. Wanless:
Bounds on the number of autotopisms and subsquares of a Latin square. 11-22 - Jakub Jasinski:
Ramsey degrees of boron tree structures. 23-44 - Nathan Keller, Guy Kindler:
Quantitative relation between noise sensitivity and influences. 45-71 - Alexander A. Sherstov:
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. 73-96 - Carsten Thomassen
:
Decomposing graphs into paths of fixed length. 97-123
Volume 33, Number 2, April 2013
- Peter Allen, Graham R. Brightwell, Jozef Skokan:
Ramsey-goodness - and otherwise. 125-160 - David K. Butler:
A characterisation of the planes meeting a non-singular quadric of PG(4, Q) in a conic. 161-179 - Jacob Fox, Choongbum Lee, Benny Sudakov:
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. 181-197 - Dániel Gerbner:
Profile polytopes of some classes of families. 199-216 - Yahya Ould Hamidoune:
Two inverse results. 217-230 - Stephen Huggett, Iain Moffatt:
Bipartite partial duals and circuits in medial graphs. 231-252
Volume 33, Number 3, June 2013
- Omid Amini, Louis Esperet, Jan van den Heuvel:
A unified approach to distance-two colouring of graphs on surfaces. 253-296 - Christine Bachoc, Arnaud Pêcher, Alain Thiéry:
On the theta number of powers of cycle graphs. 297-317 - Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan:
Circumference, chromatic number and online coloring. 319-334 - Gábor Kun:
Constraints, MMSNP and expander relational structures. 335-347 - James R. Lee, Anastasios Sidiropoulos:
Pathwidth, trees, and random embeddings. 349-374
Volume 33, Number 4, August 2013
- Antonio Avilés, Stevo Todorcevic:
Finite basis for analytic strong n-gaps. 375-393 - Eoin Long:
Long paths and cycles in subgraphs of the cube. 395-428 - Jens Marklof, Andreas Strömbergsson:
Diameters of random circulant graphs. 429-466 - Bojan Mohar, Gábor Simonyi, Gábor Tardos:
Local chromatic number of quadrangulations of surfaces. 467-495 - Wesley Pegden:
Critical graphs without triangles: An optimum density construction. 495-513
Volume 33, Number 5, October 2013
- Zdenek Dvorák, Bojan Mohar:
Chromatic number and complete graph substructures for degree sequences. 513-529 - Viktor Harangi:
On the density of triangles and squares in regular finite and unimodular random graphs. 531-548 - Naonori Kakimura, Ken-ichi Kawarabayashi:
Half-integral packing of odd cycles through prescribed vertices. 549-572 - Dragan Masulovic:
Some classes of finite homomorphism-homogeneous point-line geometries. 573-590 - Dhruv Mubayi:
Counting substructures II: Hypergraphs. 591-612 - Carsten Schultz:
Paths of homomorphisms from stable Kneser graphs. 613-621 - Guy Wolfovitz:
K 4-free graphs without large induced triangle-free subgraphs. 623-631
Volume 33, Number 6, December 2013
- Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
Lines in hypergraphs. 633-654 - Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). 655-697 - Peter Keevash, Benny Sudakov, Jacques Verstraëte:
On a conjecture of Erdős and Simonovits: Even cycles. 699-732 - Romanos-Diogenes Malikiosis:
Lattice-point enumerators of ellipsoids. 733-744
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 2024-10-31 20:18 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:
