Infinite homogeneous bipartite graphs with unequal sides
From MaRDI portal
Publication:1910569
DOI10.1016/0012-365X(94)00339-KzbMath0843.05050arXivmath/9409204MaRDI QIDQ1910569
Rami Grossberg, Martin Goldstern, Menachem Kojman
Publication date: 25 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9409204
Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Models with special properties (saturated, rigid, etc.) (03C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Set-homogeneous directed graphs, Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph, The classification of finite and locally finite connected-homogeneous digraphs, Countable homogeneous multipartite graphs, Homogeneous 2-partite digraphs, The classification of connected-homogeneous digraphs with more than one end, Countable connected-homogeneous graphs, Locally-finite connected-homogeneous digraphs, A survey of homogeneous structures, \(\aleph_0\)-categoricity of semigroups. II., Construction of some uncountable 2-arc-transitive bipartite graphs, Extending partial isomorphisms for the small index property of many \(\omega\)-categorical structures, Metrically homogeneous graphs of diameter 3
Cites Work
- Unnamed Item
- Homogeneous tournaments revisited
- Set theory. An introduction to independence proofs
- Extending partial isomorphisms of graphs
- Model theory
- Extending partial isomorphisms on finite structures
- Countable Ultrahomogeneous Undirected Graphs
- Αll $ℵ_1$-dense sets of reals can be isomorphic
- Countable Homogeneous Tournaments