On the public citation graph

Model Theoretic Methods in Finite Combinatorics

https://doi.org/10.1090/conm/558
0 signed · 48 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/bf00143892openalex-snapshot
Degrees of freedom versus dimension for containment orders
inferredcites →https://doi.org/10.1007/bf02772535openalex-snapshot
Finite presentation of homogeneous graphs, posets and Ramsey classes
inferredcites →https://doi.org/10.1007/s11083-005-9005-xopenalex-snapshot
Finite Paths are Universal
inferredcites →https://doi.org/10.1016/0095-8956(89)90038-5openalex-snapshot
For graphs there are only four types of hereditary Ramsey classes
inferredcites →https://doi.org/10.1016/j.ejc.2006.06.012openalex-snapshot
Minimal universal and dense minor closed classes
inferredcites →https://doi.org/10.1016/j.ejc.2007.02.005openalex-snapshot
Labeled posets are universal
inferredcites →https://doi.org/10.1016/j.ejc.2010.05.007openalex-snapshot
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
inferredcites →https://doi.org/10.1016/j.topol.2007.06.022openalex-snapshot
A finite presentation of the rational Urysohn space
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7022-9openalex-snapshot
Combinatorial, Algebraic and Topological Representations of Groups, Semigroups and Categories
inferredcites →https://doi.org/10.1017/jsl.2017.9openalex-snapshot
NUMBER SYSTEMS WITH SIMPLICITY HIERARCHIES: A GENERALIZATION OF CONWAY’S THEORY OF SURREAL NUMBERS II
inferredcites →https://doi.org/10.1201/9781439864159openalex-snapshot
On Numbers and Games
inferredcites →https://doi.org/10.5860/choice.42-6545openalex-snapshot
Graphs and homomorphisms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_2openalex-snapshot
Algorithmic Meta Theorems for Sparse Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_692-1openalex-snapshot
Model Checking with Fly-Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_747-1openalex-snapshot
Complexity Dichotomies for Counting Graph Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_4openalex-snapshot
A Parameterized Complexity Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_9openalex-snapshot
A Basic Parameterized Complexity Primer
inferred← citeshttps://doi.org/10.1016/j.aam.2017.04.005openalex-snapshot
On the complexity of generalized chromatic polynomials
inferred← citeshttps://doi.org/10.1016/j.aim.2013.07.021openalex-snapshot
Abstract approach to finite Ramsey theory and a self-dual Ramsey theorem
inferred← citeshttps://doi.org/10.1016/j.aim.2014.08.008openalex-snapshot
Reducts of the random partial order
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.2015.12.006openalex-snapshot
Reducts of the generic digraph
inferred← citeshttps://doi.org/10.1016/j.apal.2017.01.009openalex-snapshot
Reducts of the Henson graphs with a constant
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.007openalex-snapshot
A logician's view of graph polynomials
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103286openalex-snapshot
Forcing with copies of the Rado and Henson graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2014.08.001openalex-snapshot
Practical algorithms for MSO model-checking on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100344openalex-snapshot
Compactors for parameterized counting problems
inferred← citeshttps://doi.org/10.1016/j.disc.2015.11.022openalex-snapshot
Polynomial graph invariants from homomorphism numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113700openalex-snapshot
Modulo-counting first-order logic on bounded expansion classes
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.03.003openalex-snapshot
On the location of roots of graph polynomials
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.04.008openalex-snapshot
Universality of intervals of line graph order
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.08.002openalex-snapshot
On sequences of polynomials arising from graph invariants
inferred← citeshttps://doi.org/10.1016/j.endm.2013.07.033openalex-snapshot
On the Location of Roots of Graph Polynomials
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.087openalex-snapshot
An universality argument for graph homomorphisms
inferred← citeshttps://doi.org/10.1016/j.jal.2016.06.001openalex-snapshot
Strongly polynomial sequences as interpretations
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2021.04.035openalex-snapshot
Simplicity of the automorphism groups of generalised metric spaces
inferred← citeshttps://doi.org/10.1016/j.jpaa.2022.107114openalex-snapshot
Order-couniversality of the complete infinitary tree: An application of zero-divisor graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.026openalex-snapshot
Computations by fly-automata beyond monadic second-order logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.010openalex-snapshot
Quantified conjunctive queries on partially ordered sets
inferred← citeshttps://doi.org/10.1017/9781107477063openalex-snapshot
Complexity Dichotomies for Counting Problems
inferred← citeshttps://doi.org/10.1017/9781139028868openalex-snapshot
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
inferred← citeshttps://doi.org/10.1017/jsl.2015.74openalex-snapshot
ON PRODUCTS OF ELEMENTARILY INDIVISIBLE STRUCTURES
inferred← citeshttps://doi.org/10.1017/jsl.2016.37openalex-snapshot
THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION
inferred← citeshttps://doi.org/10.1017/jsl.2021.81openalex-snapshot
FINITE RELATION ALGEBRAS
inferred← citeshttps://doi.org/10.1145/2448496.2448498openalex-snapshot
Enumerating with constant delay the answers to a query
inferred← citeshttps://doi.org/10.1145/2463664.2463667openalex-snapshot
Enumeration of first-order queries on classes of structures with bounded expansion
inferred← citeshttps://doi.org/10.1145/2499483openalex-snapshot
Testing first-order properties for subclasses of sparse graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1409.5368openalex-snapshot
Fly-automata, model-checking and recognizability
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.