The smallest degree sum that yields potentially K_r+1-K₃-graphic sequences
The paper has a theoretical aspect and its main purpose is to determine a value for \(\sigma(K_{r+1}-K_{r}, n)\) for \(n \geq 3r+5\). This number represents the smallest even integer such that each \(n\)-term graphic sequence \(\pi = (d_{1}, d_{2},\dots, d_{n})\) has a realization containing \(K_{r+1}-K_{3}\) as a subgraph. The author reminds in the introduction the notions regarding the sequence \(\pi\) to be potentially H-graphic or \(A_{r+1}\)-graphic. He also mentions the main results in this field for \(\sigma(K_{3}, n), \sigma(K_{4}, n), \sigma(K_{5}, n)\) and \(\sigma (K_{r+1} - e, n)\). Thus the article presents the proof of the fact that \(\sigma (K_{r+1} - K_{3}, n) = (r-1)(2n-r)-2(n-2)+2\) for \(r \geq 3\) and \(n \geq 3r+5\).
- The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
- The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences
- scientific article; zbMATH DE number 1286471
- scientific article; zbMATH DE number 2114678
- scientific article; zbMATH DE number 2192182
- scientific article; zbMATH DE number 6107213
- The smallest degree sum that yields graphic sequences with a Z₃-connected realization
- scientific article; zbMATH DE number 2246360
- On the sum necessary to ensure that a degree sequence is potentially H-graphic
- A condition that yields potentially \(K_{1^3, s}\)-graphic sequences
- Algorithms for constructing graphs and digraphs with given valences and factors
- An extremal problem on the potentially \(P_k\)-graphic sequences
- Asymptotic upper bounds for Ramsey functions
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 1286471 (Why is no real title available?)
- scientific article; zbMATH DE number 867707 (Why is no real title available?)
- scientific article; zbMATH DE number 2192177 (Why is no real title available?)
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- On potentially \((K_5-H)\)-graphic sequences.
- Potentially K m — G-graphical sequences: A survey
- scientific article; zbMATH DE number 6107213 (Why is no real title available?)
- scientific article; zbMATH DE number 2114678 (Why is no real title available?)
- scientific article; zbMATH DE number 2192182 (Why is no real title available?)
This page was built for publication: The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431967)
