Distance preserving Ramsey graphs
From MaRDI portal
Recommendations
- Distance graph Ramsey sets
- On Ramsey numbers for special complete distance graphs
- Distance Ramsey numbers
- scientific article; zbMATH DE number 5079855
- Distance-perfect graphs
- On constructing regular distance-preserving graphs
- Distance domination in graphs
- scientific article; zbMATH DE number 43547
- Distance-regular graphs
- Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
Cites work
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- Isometric embedding in products of complete graphs
- Isometric embeddings of graphs
- Metric spaces are Ramsey
- Models Without Indiscernibles
- On Ramsey graphs without bipartite subgraphs
- Partitions of finite relational and set systems
- Partitionstheoreme für Graphen
- Ramsey Classes and Homogeneous Structures
- Ramsey's Theorem for a Class of Categories
- The partite construction and Ramsey set systems
Cited in
(7)- Pre-adjunctions and the Ramsey property
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- scientific article; zbMATH DE number 5079855 (Why is no real title available?)
- Conant's generalised metric spaces are Ramsey
- Forbidden cycles in metrically homogeneous graphs
- Big Ramsey degrees using parameter spaces
- Characterisation of the big Ramsey degrees of the generic partial order
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)
