Papers should contain original research, and not have been previously published
nor be currently under consideration for publication elsewhere. Refereeing and
the selection of papers follow the normal standards of JOC. For further questions,
please contact the Guest Editor.
Aim and Scope:
The development of a limit notion based on homomorphism densities for graphs, hypergraphs, and other combinatorial structures, has had interesting ramifications in combinatorics and probability, and has found applications in extremal graph theory, statistical physics, and computer science. Papers are solicited on all topics relating to this new theory, including (but not restricted to): homomorphisms, quasi-random graphs, quantum graphs, limits of sparse graphs, extremal graph theory, random infinite graphs.
Guest Editor:
Jeannette Janssen
Journal:
The new Journal of Combinatorics (JOC),
launched in 2010, publishes high-quality research papers
in all branches of combinatorics and related areas,
including both the structural as well as the algorithmic aspects of these subjects.
(Prior to 2010, International Press published the print version of the
"Electronic Journal of Combinatorics".)
Editors-in-Chief are Ron Graham and Fan Chung.
Deadline:
The submission deadline is March 30, 2012. The Special Issue is scheduled for
publication early 2013.
Submission:
Manuscripts should be submitted through the
JOC submission site.
Authors should prepare and submit their manuscripts according to the
directions given at this site.
IMPORTANT: Authors should include the message
"for the Special issue on graph limits" in "Author's comments to the editor"
when they submit their manuscripts.