On the public citation graph

Combinatorial partitions of finite posets and lattices —Ramsey lattices

https://doi.org/10.1007/bf01191498

0 signed · 68 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-010-1826-5_13openalex-snapshot

Some Recent Developments in Ramsey Theory

inferredcites →https://doi.org/10.1007/bf01894680openalex-snapshot

On chromatic number of finite set-systems

inferredcites →https://doi.org/10.1007/bf02020444openalex-snapshot

On chromatic number of graphs and set-systems

inferredcites →https://doi.org/10.1007/bfb0066788openalex-snapshot

On chromatic number of graphs and set systems

inferredcites →https://doi.org/10.1016/0012-365x(81)90207-7openalex-snapshot

Recent results in partition (Ramsey) theory for finite lattices

inferredcites →https://doi.org/10.1016/0095-8956(79)90084-4openalex-snapshot

A short proof of the existence of highly chromatic hypergraphs without short cycles

inferredcites →https://doi.org/10.1016/0097-3165(77)90004-8openalex-snapshot

Partitions of finite relational and set systems

inferredcites →https://doi.org/10.1016/b978-0-444-86893-0.50020-6openalex-snapshot

SELECTIVITY OF HYPERGRAPHS

inferredcites →https://doi.org/10.1016/s0167-5060(08)70506-5openalex-snapshot

Selective Graphs and Hypergraphs

inferredcites →https://doi.org/10.1017/cbo9780511662133.006openalex-snapshot

Partition theory and its applications

inferredcites →https://doi.org/10.1090/s0002-9947-1963-0143712-1openalex-snapshot

Regularity and positional games

inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot

On a Problem of Formal Logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4857050openalex-extracted

The exact values of Ramsey and anit-Ramsey numbers for some posets

inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_23openalex-snapshot

Subrecursive Complexity of Identifying the Ramsey Structure of Posets

inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_15openalex-snapshot

A Combinatorial Classic — Sparse Graphs with High Chromatic Number

inferred← citeshttps://doi.org/10.1007/978-3-642-61324-1_12openalex-snapshot

A Note on Boolean Dimension of Posets

inferred← citeshttps://doi.org/10.1007/978-3-642-61324-1_3openalex-snapshot

A Few Remarks on Orientation of Graphs and Ramsey Theory

inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_9openalex-snapshot

Graham-Rothschild Parameter Sets

inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_18openalex-snapshot

Partition Theorems for Graphs Respecting the Chromatic Number

inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_9openalex-snapshot

Graphs and Orders in Ramsey Theory and in Dimension Theory

inferred← citeshttps://doi.org/10.1007/bf00338745openalex-snapshot

Chain partitions of ordered sets

inferred← citeshttps://doi.org/10.1007/bf00340774openalex-snapshot

Complexity of diagrams

inferred← citeshttps://doi.org/10.1007/bf00385813openalex-snapshot

Chromatic number of Hasse diagrams, eyebrows and dimension

inferred← citeshttps://doi.org/10.1007/bf00714475openalex-snapshot

Representing orders on the plane by translating convex figures

inferred← citeshttps://doi.org/10.1007/bf02772535openalex-snapshot

Finite presentation of homogeneous graphs, posets and Ramsey classes

inferred← citeshttps://doi.org/10.1007/bf02986688openalex-snapshot

Upper Bounds for a Ramsey Theorem for Trees

inferred← citeshttps://doi.org/10.1007/s00039-005-0503-1openalex-snapshot

Fraïssé Limits, Ramsey Theory, and topological dynamics of automorphism groups

inferred← citeshttps://doi.org/10.1007/s00153-022-00849-zopenalex-snapshot

Big Ramsey degrees in universal inverse limit structures

inferred← citeshttps://doi.org/10.1007/s11083-004-3345-9openalex-snapshot

Finite Paths are Universal

inferred← citeshttps://doi.org/10.1007/s11083-005-9005-xopenalex-snapshot

Finite Paths are Universal

inferred← citeshttps://doi.org/10.1007/s11083-016-9399-7openalex-snapshot

Boolean Lattices: Ramsey Properties and Embeddings

inferred← citeshttps://doi.org/10.1007/s11083-017-9433-4openalex-snapshot

Ramsey Partial Orders from Acyclic Graphs

inferred← citeshttps://doi.org/10.1007/s11083-017-9449-9openalex-snapshot

Ramsey Numbers for Partially-Ordered Sets

inferred← citeshttps://doi.org/10.1007/s11083-018-9478-zopenalex-snapshot

The Ramsey and the Ordering Property for Classes of Lattices and Semilattices

inferred← citeshttps://doi.org/10.1007/s11856-012-0101-5openalex-snapshot

Ramsey property, ultrametric spaces, finite posets, and universal minimal flows

inferred← citeshttps://doi.org/10.1016/0012-365x(81)90207-7openalex-snapshot

Recent results in partition (Ramsey) theory for finite lattices

inferred← citeshttps://doi.org/10.1016/0012-365x(87)90009-4openalex-snapshot

A Ramsey theoretic problem for finite ordered sets

inferred← citeshttps://doi.org/10.1016/0012-365x(88)90147-1openalex-snapshot

Some remarks on natural orders for combinatorial cubes

inferred← citeshttps://doi.org/10.1016/0012-365x(91)90004-lopenalex-snapshot

Reorientations of covering graphs

inferred← citeshttps://doi.org/10.1016/0097-3165(91)90006-3openalex-snapshot

A Ramseyian theorem on products of trees

inferred← citeshttps://doi.org/10.1016/j.aim.2019.106791openalex-snapshot

All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

inferred← citeshttps://doi.org/10.1016/j.aim.2022.108585openalex-snapshot

On big Ramsey degrees for binary free amalgamation classes

inferred← citeshttps://doi.org/10.1016/j.aim.2025.110386openalex-snapshot

Big Ramsey degrees using parameter spaces

inferred← citeshttps://doi.org/10.1016/j.apal.2005.07.004openalex-snapshot

Ramsey classes of topological and metric spaces

inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100814openalex-snapshot

Twenty years of Nešetřil’s classification programme of Ramsey classes

inferred← citeshttps://doi.org/10.1016/j.disc.2024.114031openalex-snapshot

Poset Ramsey number R(P,Q). III. Chain compositions and antichains

inferred← citeshttps://doi.org/10.1016/j.disc.2024.114045openalex-snapshot

Ramsey properties for V-shaped posets in the Boolean lattice

inferred← citeshttps://doi.org/10.1016/j.disc.2025.114858openalex-snapshot

Diagonal poset Ramsey numbers

inferred← citeshttps://doi.org/10.1016/j.ejc.2004.11.003openalex-snapshot

Metric spaces are Ramsey

inferred← citeshttps://doi.org/10.1016/j.ejc.2019.05.001openalex-snapshot

A Ramsey theorem for multiposets

inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.100openalex-snapshot

Ramsey classes with forbidden homomorphisms and a closure

inferred← citeshttps://doi.org/10.1016/j.jcta.2017.09.001openalex-snapshot

A Ramsey class for Steiner systems

inferred← citeshttps://doi.org/10.1016/j.topol.2008.12.005openalex-snapshot

Some recollections on early work with Jan Pelant

inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00236-1openalex-snapshot

Symmetry and the Ramsey degree of posets

inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70478-3openalex-snapshot

Problems and Conjectures in the Combinatorial Theory of Ordered Sets

inferred← citeshttps://doi.org/10.1017/jsl.2014.40openalex-snapshot

SEMILATTICES AND THE RAMSEY PROPERTY

inferred← citeshttps://doi.org/10.1017/s0963548304006716openalex-snapshot

Ramsey Classes and Homogeneous Structures

inferred← citeshttps://doi.org/10.1017/s096354831200003xopenalex-snapshot

Distance Preserving Ramsey Graphs

inferred← citeshttps://doi.org/10.1017/s0963548323000032openalex-snapshot

Poset Ramsey numbers: large Boolean lattice versus a fixed poset

inferred← citeshttps://doi.org/10.1090/dimacs/049/24openalex-snapshot

Ramsey theory and partially ordered sets

inferred← citeshttps://doi.org/10.1112/jlms/54.1.199openalex-snapshot

Descriptive Complexity and Reflective Properties of Combinatorial Configurations

inferred← citeshttps://doi.org/10.18297/etd/3942openalex-snapshot

Dimension and Ramsey results in partially ordered sets.

inferred← citeshttps://doi.org/10.37236/3151openalex-snapshot

Ramsey Properties of Countably Infinite Partial Orderings

inferred← citeshttps://doi.org/10.4064/fm221-3-1openalex-snapshot

Relational quotients

inferred← citeshttps://doi.org/10.48550/arxiv.1209.6421openalex-snapshot

A Ramsey space of infinite polyhedra and the random polyhedron

inferred← citeshttps://doi.org/10.48550/arxiv.1909.08680openalex-snapshot

Poset Ramsey Numbers for Boolean Lattices

inferred← citeshttps://doi.org/10.48550/arxiv.2010.05041openalex-snapshot

Structural Ramsey Theory and the Extension Property for Partial Automorphisms

inferred← citeshttps://doi.org/10.48550/arxiv.2012.06507openalex-snapshot

Ramsey properties of products of chains

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.