On a problem of Cameron's on inexhaustible graphs

DOI10.1007/S00493-004-0003-1zbMATH Open1047.05036OpenAlexW2169348214MaRDI QIDQ1882142

Anthony Bonato, Dejan Delić

Publication date: 19 October 2004

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-004-0003-1

zbMATH Keywords

infinite graphsinfinite random graphinexhaustible graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Model theory of denumerable and separable structures (03C15)

Related Items (1)

Cameron's construction of two-graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Properties of the automorphism group and a probabilistic construction of a class of countable labeled structures 👍 👎
• All countable monoids embed into the monoid of the infinite random graph 👍 👎
• Countable connected-homogeneous graphs 👍 👎
• Spanning trees of countable graphs omitting sets of dominated ends 👍 👎
• A family of universal pseudo-homogeneous \(G\)-colourable graphs 👍 👎
• \(>k\)-homogeneous infinite graphs 👍 👎
• The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs 👍 👎
• Countably determined ends and graphs 👍 👎

This page was built for publication: On a problem of Cameron's on inexhaustible graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882142)