Journals Journal of Combinatorics Volume 1


Journal of Combinatorics

Editors-in-Chief:
Fan Chung and Ron Graham

ISSN: 2156-3527 (print); 2150-959X (online)
For price information see How To Order/Price Lists

Back to JOC Index

Back to Browse

Volume 1 (2010)

[ Number 1 | Number 2 | Number 3 | Number 4 ]

Volume 1, Number 1 [Top]
Gerhard Guettler and Colin Mallows
A generalization of Apollonian packing of circles
                View Article (PDF)
p.1-28
Fan Chung, Ron Graham and Don Knuth
A symmetrical Eulerian identity
                View Article (PDF)
p.29-38
Einar Steingrımsson and Bridget Eileen Tenner
The Mobius function of the permutation pattern poset
                View Article (PDF)
p.39-52
J. Wolf
The minimum number of monochromatic 4-term progressions in Zp
                View Article (PDF)
p.53-68
John E. Wetzel and Wacharin Wichiramala
A covering theorem for families of sets in Rd
                View Article (PDF)
p.69-76
Roland Bacher and Shalom Eliahou
Extremal binary matrices without constant 2-squares
                View Article (PDF)
p.77-100

Volume 1, Number 2 [Top]
Carsten Thomassen
Spanning trees and orientations of graphs
                View Article (PDF)
p.101-112
Vance Faber
The Erdos-Faber-Lovasz conjecture - the uniform regular case
                View Article (PDF)
p.113-120
Steve Butler and Ron Graham
Shuffling with ordered cards
                View Article (PDF)
p.121-140
Anthony Bonato and Dejan Delic
Distinguishing number and adjacency properties
                View Article (PDF)
p.141-148
Tom Bohman, Maria Fonoberova and Oleg Pikhurko
The saturation function of complete partite graphs
                View Article (PDF)
p.149-170
Jozsef Beck
Lattice point counting and the probabilistic method
                View Article (PDF)
p.171-232

Volume 1, Numbers 3 and 4 [Top]
Prasad Tetali
A note from the Guest Editor
                View Article (PDF)
p.233
Noga Alon
To Joel, on his 60+ birthday
                View Article (PDF)
p.235-236
Joel Spencer
Potpourri
                View Article (PDF)
p.237-264
Kevin P. Costello, Asaf Shapira and Prasad Tetali
On randomizing two derandomized greedy algorithms
                View Article (PDF)
p.265-284
Roberto Imbuzeiro Oliveira
The spectrum of random k-lifts of large graphs (with possibly large k)
                View Article (PDF)
p.285-306
Joshua N. Cooper and Robert B. Ellis
Linearly bounded liars, adaptive covering codes, and deterministic random walks
                View Article (PDF)
p.307-334
Janos Pach and Geza Toth
Disjoint edges in topological graphs
                View Article (PDF)
p.335-344
Noga Alon and Benny Sudakov
Increasing the chromatic number of a random graph
                View Article (PDF)
p.345-356
Svante Janson
Susceptibility of random graphs with given vertex degrees
                View Article (PDF)
p.357-388
Simi Haber and Michael Krivelevich
The logic of random regular graphs
                View Article (PDF)
p.389-440
Hanno Lefmann, Yury Person and Mathias Schacht
A structural result for hypergraphs with many restricted edge colorings
                View Article (PDF)
p.441-475
Tom Bohman, Alan Frieze, and Eyal Lubetzky
A note on the random greedy triangle packing algorithm
                View Article (PDF)
p.477-488

Go to top of page


The hardcopy and electronic editions of the Journal of Combinatorics are protected by the copyright of the International Press of Boston.


Home | Contact Us 
Copyright © International Press. All rights reserved.