An extremal problem on potentially K_p,1,1-graphic sequences
A sequence S is potentially K_p,1,1 graphical if it has a realization containing a K_p,1,1 as a subgraph, where K_p,1,1 is a complete 3-partite graph with partition sizes p,1,1. Let σ (K_p,1,1, n) denote the smallest degree sum such that every n-term graphical sequence S with σ (S)≥ σ (K_p,1,1, n) i...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/357/pdf |