Journal: Combinatorica

Volume 29, Issue 6

629 -- 635Mei-Chu Chang. Explicit sum-product theorems for large subsets of /mathbb::::F::::::::::p::::::
637 -- 663Gary L. Ebert, Giuseppe Marino, Olga Polverino, Rocco Trombetti. Infinite families of new semifields
665 -- 689Babak Farzad, Michael Molloy. On the edge-density of 4-critical graphs
691 -- 698Komei Fukuda, Sonoko Moriyama, Hiroki Nakayama, Jürgen Richter-Gebert. Every non-Euclidean oriented matroid admits a biquadratic final polynomial
699 -- 718Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla. Monochromatic triangles in two-colored plane
719 -- 743Emanuele Viola, Avi Wigderson. One-way multiparty communication lower bound for pointer jumping with applications

Volume 29, Issue 5

511 -- 522Simeon Ball, Oriol Serra. Punctured combinatorial Nullstellensätze
523 -- 546Saugata Basu, Richard Pollack, Marie-Françoise Roy. An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
547 -- 568Dan Hefetz, Michael Krivelevich, Tibor Szabó. Hamilton cycles in highly connected and expanding graphs
569 -- 594Beukje Temmermans, Joseph A. Thas, Hendrik Van Maldeghem. On collineations and dualities of finite generalized polygons
595 -- 618Baogang Xu, Xingxing Yu. On a bipartition problem of Bollobás and Scott
619 -- 628Tamás Király, Jácint Szabó. A note on parity constrained orientations

Volume 29, Issue 4

389 -- 431Noga Alon, Eyal Lubetzky. Uniformly cross intersecting families
433 -- 448Anton Dochtermann. The universality of Hom complexes of graphs
449 -- 466Attila Pór, David R. Wood. Colourings of the cartesian product of graphs and multiplicative Sidon sets
467 -- 501Vojtech Rödl, Mathias Schacht. Generalizations of the removal lemma
503 -- 509John P. Steinberger. Tilings of the integers can have superpolynomial periods

Volume 29, Issue 3

263 -- 297Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus. Embeddings and Ramsey numbers of sparse ::::kappa::::-uniform hypergraphs
299 -- 326Bill Cuckler, Jeff Kahn. Hamiltonian cycles in Dirac graphs
327 -- 335Bill Cuckler, Jeff Kahn. Entropy bounds for perfect matchings and Hamiltonian cycles
337 -- 361Hein van der Holst, Rudi Pendavingh. On a graph property generalizing planarity and flatness
363 -- 387Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi. On the Fourier spectrum of symmetric Boolean functions

Volume 29, Issue 2

131 -- 151Béla Bollobás, Boris Pittel. The distribution of the root degree of a random permutation
153 -- 196Jacob Fox, Benny Sudakov. Density theorems for bipartite graphs and related Ramsey-type results
197 -- 214Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa. Arc-disjoint in-trees in directed graphs
215 -- 225Ken-ichi Kawarabayashi, Bruce A. Reed. Highly parity linked graphs
227 -- 262Vladimir Nikiforov, Cecil C. Rousseau. Ramsey goodness and beyond

Volume 29, Issue 1

1 -- 17John Bamberg, Maska Law, Tim Penttila. Tight sets and ::::m::::-ovoids of generalised quadrangles
19 -- 25Massimo Giulietti. Line partitions of internal points to a conic in ::::PG::::(2, ::::q::::)
27 -- 48Marek Janata, Jácint Szabó. The superstar packing problem
49 -- 64Hal A. Kierstead, Goran Konjevod. Coloring number and on-line Ramsey theory for graphs and hypergraphs
65 -- 107Daniela Kühn, Deryk Osthus. The minimum degree threshold for perfect graph packings
109 -- 119Serguei Norine. Drawing 4-Pfaffian graphs on the torus
121 -- 126Werner Schwärzler. On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
127 -- 129Masao Tsugaki. A note on a spanning 3-tree