An extremal problem on potentially \(K_{r,s}\)-graphic sequences
From MaRDI portal
Publication:1861273
DOI10.1016/S0012-365X(02)00765-3zbMath1017.05055MaRDI QIDQ1861273
Publication date: 16 March 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (17)
Graphic sequences with a realization containing intersecting cliques ⋮ A variation of a classical Turán-type extremal problem ⋮ Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences ⋮ The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\) ⋮ A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic ⋮ A complete characterization of graphic sequences with a \(Z_3\)-connected realization ⋮ Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices ⋮ Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \) ⋮ Graphic sequences with a realization containing a union of cliques ⋮ Graphic sequences with a realization containing a generalized friendship graph ⋮ Graphic sequences with a realization containing a complete multipartite subgraph ⋮ Potentially K m — G-graphical sequences: A survey ⋮ On potentially H-graphic sequences ⋮ On the potential function of an arbitrary graph \(H\) ⋮ A variation of a conjecture due to Erdös and Sós ⋮ An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices ⋮ An Erdős-Stone Type Conjecture for Graphic Sequences
This page was built for publication: An extremal problem on potentially \(K_{r,s}\)-graphic sequences
