Finite presentation of homogeneous graphs, posets and Ramsey classes
From MaRDI portal
Publication:814132
DOI10.1007/BF02772535zbMath1091.05070OpenAlexW2015562991WikidataQ105323691 ScholiaQ105323691MaRDI QIDQ814132
Jan Hubička, Jaroslav Nešetřil
Publication date: 6 February 2006
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02772535
Related Items
Set-homogeneous directed graphs, Ramsey classes of topological and metric spaces, A finite presentation of the rational Urysohn space, Posets, homomorphisms and homogeneity, Countable connected-homogeneous graphs, A survey of homogeneous structures, Universality of intervals of line graph order, All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms), A characterization of retracts in certain Fraïssé limits
Cites Work
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- On the succinct representation of graphs
- On locally presented posets
- Theory of relations. Transl. from the French by P. Clote
- Countable homogeneous partially ordered sets
- Endomorphism monoids and topological subgraphs of graphs
- Mathematics of Ramsey theory. Collected papers of the Prague symposium on graph theory held in Prague, Czechoslovakia
- Partitions of finite relational and set systems
- For graphs there are only four types of hereditary Ramsey classes
- Automorphism groups of graphs and edge-contraction
- Succinct representation of general unlabeled graphs
- On universal partly ordered sets and classes
- Ramsey's theorem for a class of categories
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Number systems with simplicity hierarchies: a generalization of Conway's theory of surreal numbers
- Strong Ramsey Theorems for Steiner Systems
- Countable Ultrahomogeneous Undirected Graphs
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- Ramsey Classes and Homogeneous Structures
- Path homomorphisms
- Countable Homogeneous Tournaments
- The random graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item