The potential-Ramsey number of K_n and K_t^{-k}
From MaRDI portal
Publication:5084258
Recommendations
Cites work
- A degree sequence variant of graph Ramsey numbers
- A further result on the potential-Ramsey number of G1 and G2
- A General Lower Bound for Potentially H-Graphic Sequences
- A new lower bound on the potential-Ramsey number of two graphs
- A remark on the existence of finite graphs
- A variation of a conjecture due to Erdös and Sós
- Chromatic number and complete graph substructures for degree sequences
- Graph theory with applications
- Graphic sequences and split graphs
- Hadwiger number and chromatic number for near regular degree sequences
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3758373 (Why is no real title available?)
- scientific article; zbMATH DE number 867707 (Why is no real title available?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the sum necessary to ensure that a degree sequence is potentially H-graphic
- Packing of graphic n-tuples
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
This page was built for publication: The potential-Ramsey number of $K_n$ and $K_t^{-k}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084258)