An extremal problem on potentially K_r+1-H-graphic sequences.
From MaRDI portal
Publication:3094549
Recommendations
Cited in
(16)- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences
- Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices
- On the potential function of an arbitrary graph \(H\)
- An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices
- On potentially \((K_5-H)\)-graphic sequences.
- Potentially K m — G-graphical sequences: A survey
- On potentially \(K_{r+1}-U\)-graphical sequences
- An extremal problem on potentially \(K_{r+1}-K_{1,t}\)-graphic sequences
- scientific article; zbMATH DE number 1293748 (Why is no real title available?)
- scientific article; zbMATH DE number 713480 (Why is no real title available?)
- scientific article; zbMATH DE number 1931321 (Why is no real title available?)
- On the potential number of \(K_{r+1}-E(H)\)
- A General Lower Bound for Potentially H-Graphic Sequences
- On the sum necessary to ensure that a degree sequence is potentially H-graphic
- Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
This page was built for publication: An extremal problem on potentially \(K_{r+1}-H\)-graphic sequences.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094549)
