Distance preserving Ramsey graphs
From MaRDI portal
Publication:2908128
DOI10.1017/S096354831200003XzbMATH Open1247.05148OpenAlexW1993561921MaRDI QIDQ2908128FDOQ2908128
Domingos Dellamonica, Vojtěch Rödl
Publication date: 4 September 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096354831200003x
Cites Work
- The partite construction and Ramsey set systems
- Partitions of finite relational and set systems
- Models Without Indiscernibles
- Metric spaces are Ramsey
- Isometric embedding in products of complete graphs
- Ramsey Classes and Homogeneous Structures
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Isometric embeddings of graphs
- Partitionstheoreme für Graphen
- On Ramsey graphs without bipartite subgraphs
- Ramsey's Theorem for a Class of Categories
Cited In (4)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Distance-regular graphs 👍 👎
- Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces 👍 👎
- Distance Domination in Graphs 👍 👎
- Distance Ramsey numbers 👍 👎
- On Ramsey numbers for special complete distance graphs 👍 👎
- On Constructing Regular Distance-Preserving Graphs 👍 👎
This page was built for publication: Distance preserving Ramsey graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908128)