Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
From MaRDI portal
Publication:6162035
DOI10.1016/j.dam.2023.05.007zbMath1516.05033WikidataQ123189957 ScholiaQ123189957MaRDI QIDQ6162035
Publication date: 15 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
degree sequencepotential functiongraphic sequencepotentially \(P ( \ell,k )\)-graphic sequencerealization5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- Graphic sequences with a realization containing a union of cliques
- Graphic sequences with a realization containing a generalized friendship graph
- A variation of a conjecture due to Erdös and Sós
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- An extremal problem on the potentially \(P_k\)-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
- The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- On a characterization of k-trees
- A remark on the existence of finite graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A note on the potential function of an arbitrary graph H
- A General Lower Bound for Potentially H-Graphic Sequences
This page was built for publication: Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
