On the public citation graph
Hereditary Properties of Tournaments
0 signed · 36 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.20266openalex-snapshot
Hereditary properties of combinatorial structures: Posets and oriented graphs
inferredcites →https://doi.org/10.1006/jcta.1996.0017openalex-snapshot
The Average Number of Linear Extensions of a Partial Order
inferredcites →https://doi.org/10.1006/jctb.2000.1952openalex-snapshot
The Speed of Hereditary Properties of Graphs
inferredcites →https://doi.org/10.1007/3-540-33700-8_12openalex-snapshot
Hereditary Properties of Ordered Graphs
inferredcites →https://doi.org/10.1007/978-1-4614-7254-4_6openalex-snapshot
Hereditary and Monotone Properties of Graphs
inferredcites →https://doi.org/10.1007/978-3-642-60406-5_7openalex-snapshot
Hereditary and Monotone Properties of Graphs
inferredcites →https://doi.org/10.1007/bf00143892openalex-snapshot
Degrees of freedom versus dimension for containment orders
inferredcites →https://doi.org/10.1007/bf00405592openalex-snapshot
The number of partial orders of fixed width
inferredcites →https://doi.org/10.1007/bf01504345openalex-snapshot
�ber die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten
inferredcites →https://doi.org/10.1016/j.jcta.2004.04.002openalex-snapshot
Excluded permutation matrices and the Stanley–Wilf conjecture
inferredcites →https://doi.org/10.1016/j.jctb.2005.02.004openalex-snapshot
A jump to the bell number for hereditary graph properties
inferredcites →https://doi.org/10.1016/s0012-365x(98)00312-4openalex-snapshot
Forbidden induced partial orders
inferredcites →https://doi.org/10.1016/s0097-3165(04)00051-2openalex-snapshot
Excluded permutation matrices and the Stanley?Wilf conjecture
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20266openalex-snapshot
Hereditary properties of combinatorial structures: Posets and oriented graphs
inferred← citeshttps://doi.org/10.1002/rsa.20777openalex-snapshot
Multicolor containers, extremal entropy, and counting
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_12openalex-snapshot
Hereditary Properties of Ordered Graphs
inferred← citeshttps://doi.org/10.1007/s00009-025-03021-yopenalex-snapshot
Ordered Structures with No Finite Monomorphic Decomposition: Application to the Profile of Hereditary Classes
inferred← citeshttps://doi.org/10.1007/s11083-024-09664-yopenalex-snapshot
Well-quasi-ordering and Embeddability of Relational Structures
inferred← citeshttps://doi.org/10.1016/j.apal.2018.01.002openalex-snapshot
Structure and enumeration theorems for hereditary properties in finite relational languages
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103813openalex-snapshot
Hereditary classes of ordered sets of width at most two
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.03.001openalex-snapshot
Growth constants of minor-closed classes of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.10.001openalex-snapshot
The structure of almost all graphs in a hereditary property
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.12.008openalex-snapshot
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.12.004openalex-snapshot
Jumps in speeds of hereditary properties in finite relational languages
inferred← citeshttps://doi.org/10.1017/cbo9780511902499.002openalex-snapshot
Some general results in combinatorial enumeration
inferred← citeshttps://doi.org/10.1017/cbo9780511902499.003openalex-snapshot
A survey of simple permutations
inferred← citeshttps://doi.org/10.1112/plms.12250openalex-snapshot
Growth rates of permutation classes: from countable to uncountable
inferred← citeshttps://doi.org/10.21494/iste.op.2020.0542openalex-snapshot
Hereditary classes of ordered binary structures
inferred← citeshttps://doi.org/10.48550/arxiv.0803.4292openalex-snapshot
Overview of some general results in combinatorial enumeration
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6178openalex-snapshot
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1432openalex-snapshot
Décomposition monomorphe des structures relationnelles et profil de classes héréditaires
inferred← citeshttps://doi.org/10.48550/arxiv.1607.08152openalex-snapshot
Multicolour containers and the entropy of decorated graph limits
inferred← citeshttps://doi.org/10.48550/arxiv.1703.03080openalex-snapshot
Typical structure of oriented graphs and digraphs with forbidden blow-up transitive triangle
inferred← citeshttps://doi.org/10.48550/arxiv.1801.05195openalex-snapshot
Multicolour containers, extremal entropy and counting
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.