On the order of countable graphs
From MaRDI portal
Publication:1404996
DOI10.1016/S0195-6698(03)00064-7zbMath1030.03028arXivmath/0404319MaRDI QIDQ1404996
Jaroslav Nešetřil, Saharon Shelah
Publication date: 25 August 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0404319
Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Models with special properties (saturated, rigid, etc.) (03C50) Applications of model theory (03C98) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Model theory of ordered structures; o-minimality (03C64)
Related Items
On low tree-depth decompositions, Generalised dualities and maximal finite antichains in the homomorphism order of relational structures, On nowhere dense graphs, On the tree-depth of random graphs, Tree-depth, subgraph coloring and homomorphism bounds, On low rank-width colorings, There is no universal countable random-free graph, A surprising permanence of old motivations (a not-so-rigid story), Counting Homomorphisms to Sparse Graphs, On Treewidth and Related Parameters of Random Geometric Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some universal graphs
- Chromatically optimal rigid graphs
- Color-families are dense
- Universal graphs with forbidden subgraphs and algebraic closure
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Every finite graph is a full subgraph of a rigid graph
- Universal Infinite Partially Ordered Sets
- Universal relational systems
- Universal graphs without large bipartite subgraphs
- High Chromatic Rigid Graphs II
- The Homomorphism Structure of Classes of Graphs
- A rigid graph for every set
- Universal graphs and universal functions
- A family of countable homogeneous graphs
