Universal graphs with a forbidden subtree
From MaRDI portal
Publication:875935
DOI10.1016/j.jctb.2006.05.008zbMath1116.03026arXivmath/0512218WikidataQ28112265 ScholiaQ28112265MaRDI QIDQ875935
Saharon Shelah, Gregory L. Cherlin
Publication date: 16 April 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0512218
05C05: Trees
05C75: Structural characterization of families of graphs
03C50: Models with special properties (saturated, rigid, etc.)
03C30: Other model constructions
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some universal graphs
- Universal graphs with forbidden subgraphs and algebraic closure
- Universal arrow-free graphs
- Nonexistence of universal graphs without some trees
- Forbidden subgraphs and forbidden substructures
- Universal graphs without large bipartite subgraphs
- Universal graphs with a forbidden near‐path or 2‐bouquet
- Some remarks on universal graphs