Logo - springer
Slogan - springer

Mathematics - Geometry & Topology | Order – incl. option to publish open access (Editorial Board)

Order

Order

A Journal on the Theory of Ordered Sets and its Applications

Editor-in-Chief: Ryan R. Martin

ISSN: 0167-8094 (print version)
ISSN: 1572-9273 (electronic version)

Journal no. 11083

$99.00 Personal Rate e-only for the Americas
Get Subscription

Online subscription, valid from January through December of current calendar year

Immediate access to this year's issues via SpringerLink

1 Volume(-s) with 3 issue(-s) per annual subscription

Automatic annual renewal

More information: >> FAQs // >> Policy

Editor-in-Chief:

R. Martin, Iowa State University: Extremal graph theory; extremal poset theory; probabilistic combinatorics

Editorial Board:

K. Adaricheva, Hofstra University: Semidistributive lattices; convex geometries and antimatroids; lattices of classes and theories; lattices in knowledge representation, AI and combinatorics

R. Aharoni, Technion, Israel Institute for Technology: Matching theory, in particular in hypergraphs; duality;topological methods in combinatorics

H. Alt, Freie Universität Berlin: Algorithms and complexity; computational geometry; pattern and shape Analysis

M. Aschenbrenner, University of California, Los Angeles: Ordered algebraic structures; interactions between the theory of ordered sets and mathematical logic

M. Axenovich, Karlsruhe Institute of Technology: Ramsey and anti-Ramsey type problems in graphs, integers, partially ordered sets; extremal problems in graphs

G.R. Brightwell, London School of Economics: Combinatorics of finite partially ordered sets; random structures and processes; asymptotic enumeration

J.-P. Doignon, Université Libre de Bruxelles: Combinatorics of partial orders, especially interval orders and semiorders; order polytopes; applications to human sciences

D. Duffus, Emory University: Combinatorics of partially ordered sets, set systems and finite lattices; homomorphisms of relational Systems

M. Erné, Leibniz University: Combinatorics of finite orders; distributivity, continuous lattices and domains; adjunctions and duality; order, topology and closure

D. Feichtner-Kozlov, University of Bremen: Topological properties of partially ordered sets

S. Felsner, Technical University Berlin: Graph theory, discrete geometry, ordered sets, particularly dimension, related parameters and containment orders

R. Freese, University of Hawaii: Modular and semidistributive lattices, free lattices, congruence lattices; lattice algorithms

J. Griggs, University of South Carolina: Combinatorics of partially ordered sets, especially families of subsets; extremal and structural problems; Sperner theory

G. Gutin, Royal Holloway, University of London: Combinatorial structures and algorithms, in particular digraph theory and algorithms

J. Harding, New Mexico State University: Lattices and ordered algebraic structures, particularly completions, and structures arising in logic, topology, and theoretical physics

P. Jipsen, Chapman University: Lattice theory

J. Kahn, Rutgers University: Probabilistic and other non-combinatorial methods; linear extensions

K. Kearnes, University of Colorado: Lattice theory; ordered algebraic structures

A. Kostochka, University of Illinois at Urbana-Champaign: Graphs; digraphs and set systems; dimension of partially ordered sets.

C. Laflamme, University of Calgary: Set theory; infinite combinatorics and orders

B. Larose, Champlain College and Concordia University: Complexity and digraph homomorphisms; algebraic and topological aspects of posets and digraphs

L. Lu, University of South Carolina: Large information networks; probabilistic methods; spectral graph theory; random graphs; extremal problems on hypergraphs and posets; algorithms; graph theory

D. Mubayi, University of Illinois at Chicago: Extremal and probabilistic questions on all finite structures, including graphs, partially ordered sets and hypergraphs

S. Shahriari, Pomona College: Combinatorics of subset and subspace lattices, normalized matching posets, and related Areas

J. Stembridge, University of Michigan: Enumerative and combinatorial aspects of partially ordered sets

G. Tardos, Rényi Institute of Mathematics, Budapest: Combinatorics; discrete and computational geometry; complexity theory

W.T. Trotter, Georgia Institute of Technology: Extremal problems for graphs and posets; on-line algorithms, approximation algorithms; Ramsey theory; discrete geometry and optimization

D.B. West, University of Illinois at Urbana-Champaign: Extremal and structural problems for partially ordered sets; connections to graph theory

Read this Journal on Springerlink

For authors and editors


  • Journal Citation Reports®
    2016 Impact Factor
  • 0.383
  • Aims and Scope

    Aims and Scope

    Close

    Order presents the most original and innovative research on ordered structures and the use of order-theoretic methods in graph theory and combinatorics, lattice theory and algebra, set theory and relational structures, and the theory of computing. In each of these categories, we seek submissions that make significant use of orderings to study mathematical structures and processes. The interplay of order and combinatorics is of particular interest, as are the application of order-theoretic tools to algorithms in discrete mathematics and computing. Articles on both finite and infinite order theory are welcome. 

    The scope of Order is further defined by the collective interests and expertise of the editorial board, which are described on these pages. Submitting authors are asked to identify a board member, or members, whose interests best match the topic of their work, as this helps to ensure an efficient and authoritative review.

  • Submit Online
  • Open Choice - Your Way to Open Access
  • Instructions for Authors
  • Author Academy: Training for Authors
  • Copyright Information

    Copyright Information

    Close

    Copyright Information

    For Authors

    Submission of a manuscript implies: that the work described has not been published before (except in form of an abstract or as part of a published lecture, review or thesis); that it is not under consideration for publication elsewhere; that its publication has been approved by all co-authors, if any, as well as – tacitly or explicitly – by the responsible authorities at the institution where the work was carried out.

    Author warrants (i) that he/she is the sole owner or has been authorized by any additional copyright owner to assign the right, (ii) that the article does not infringe any third party rights and no license from or payments to a third party is required to publish the article and (iii) that the article has not been previously published or licensed. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. Transfer of copyright to Springer (respective to owner if other than Springer) becomes effective if and when a Copyright Transfer Statement is signed or transferred electronically by the corresponding author. After submission of the Copyright Transfer Statement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted by Springer.

    The copyright to this article, including any graphic elements therein (e.g. illustrations, charts, moving images), is assigned for good and valuable consideration to Springer effective if and when the article is accepted for publication and to the extent assignable if assignability is restricted for by applicable law or regulations (e.g. for U.S. government or crown employees).

    The copyright assignment includes without limitation the exclusive, assignable and sublicensable right, unlimited in time and territory, to reproduce, publish, distribute, transmit, make available and store the article, including abstracts thereof, in all forms of media of expression now known or developed in the future, including pre- and reprints, translations, photographic reproductions and microform. Springer may use the article in whole or in part in electronic form, such as use in databases or data networks for display, print or download to stationary or portable devices. This includes interactive and multimedia use and the right to alter the article to the extent necessary for such use.

    Authors may self-archive the Author's accepted manuscript of their articles on their own websites. Authors may also deposit this version of the article in any repository, provided it is only made publicly available 12 months after official publication or later. He/she may not use the publisher's version (the final article), which is posted on SpringerLink and other Springer websites, for the purpose of self-archiving or deposit. Furthermore, the Author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at link.springer.com".

    Prior versions of the article published on non-commercial pre-print servers like arXiv.org can remain on these servers and/or can be updated with Author's accepted version. The final published version (in pdf or html/xml format) cannot be used for this purpose. Acknowledgement needs to be given to the final publication and a link must be inserted to the published article on Springer's website, accompanied by the text "The final publication is available at link.springer.com". Author retains the right to use his/her article for his/her further scientific career by including the final published journal article in other publications such as dissertations and postdoctoral qualifications provided acknowledgement is given to the original source of publication.

    Author is requested to use the appropriate DOI for the article. Articles disseminated via link.springer.com are indexed, abstracted and referenced by many abstracting and information services, bibliographic networks, subscription agencies, library networks, and consortia.

    For Readers

    While the advice and information in this journal is believed to be true and accurate at the date of its publication, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may have been made. The publisher makes no warranty, express or implied, with respect to the material contained herein.

    All articles published in this journal are protected by copyright, which covers the exclusive rights to reproduce and distribute the article (e.g., as offprints), as well as all translation rights. No material published in this journal may be reproduced photographically or stored on microfilm, in electronic data bases, video disks, etc., without first obtaining written permission from the publisher (respective the copyright owner if other than Springer). The use of general descriptive names, trade names, trademarks, etc., in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.

    Springer has partnered with Copyright Clearance Center's RightsLink service to offer a variety of options for reusing Springer content. For permission to reuse our content please locate the material that you wish to use on link.springer.com or on springerimages.com and click on the permissions link or go to copyright.com, then enter the title of the publication that you wish to use. For assistance in placing a permission request, Copyright Clearance Center can be connected directly via phone: +1-855-239-3415, fax: +1-978-646-8600, or e-mail: info@copyright.com.


    © Springer Science+Business Media Dordrecht

Alerts for this journal

 

Get the table of contents of every new issue published in Order.