A note on potentially K₄-e graphical sequences
From MaRDI portal
A note on potentially \(K 4-e\) graphical sequences
Let \(H\) be a graph. A graphical sequence \(S\) is potentially \(H\)-graphical if there is a realization of \(S\) containing \(H\) as a subgraph. The author studies the problem of determining the minimum even integer \(m\) such that every \(n\)-term graphical sequence \(S\) with \(\sigma(S)\geq m\) is potentially \(H\)-graphical. This number \(m\) is denoted by \(\sigma(H,n)\). The author continues the study of \(\sigma(H,n)\) and determines the exact value of \(\sigma(K_4-e,n)\) for \(n\geq 4\).
Recommendations
Cited in
(9)- The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
- Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices
- 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
- An Erdős-Stone Type Conjecture for Graphic Sequences
- On potentially \(K_{r+1}-U\)-graphical sequences
- scientific article; zbMATH DE number 1931321 (Why is no real title available?)
- scientific article; zbMATH DE number 1910717 (Why is no real title available?)
This page was built for publication: A note on potentially \(K_4-e\) graphical sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760432)
