On the potential function of an arbitrary graph H

DOI10.1016/J.EJC.2019.103061MaRDI QIDQ2297918zbMATH OpenOpenAlexFDO

Authors Jian-Hua Yin

Publication date 20 February 2020

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2019.103061

zbMATH Keywords

potentially \(H\)-graphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35)

Recommendations

• On the sum necessary to ensure that a degree sequence is potentially H-graphic
• A General Lower Bound for Potentially H-Graphic Sequences
• Stability of the potential function
• A note on potentially \(K_{1,1,t}\)-graphic sequences
• An extremal problem on potentially \(K_{r+1}-H\)-graphic sequences.

Cites work

• A General Lower Bound for Potentially H-Graphic Sequences
• A remark on the existence of finite graphs
• A variation of a classical Turán-type extremal problem
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• An extremal problem on the potentially \(P_k\)-graphic sequences
• Graphic sequences with a realization containing a friendship graph
• Graphic sequences with a realization containing a generalized friendship graph
• Graphic sequences with a realization containing a union of cliques
• Graphic sequences with a realization containing intersecting cliques
• scientific article; zbMATH DE number 3743297 (Why is no real title available?)
• scientific article; zbMATH DE number 3588696 (Why is no real title available?)
• scientific article; zbMATH DE number 1286471 (Why is no real title available?)
• scientific article; zbMATH DE number 2114678 (Why is no real title available?)
• scientific article; zbMATH DE number 867707 (Why is no real title available?)
• On maximal paths and circuits of graphs
• On potentially \(K_{r_1,r_2,\dots,r_m}\)-graphic sequences
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the approximate shape of degree sequences that are not potentially H-graphic
• On the sum necessary to ensure that a degree sequence is potentially H-graphic
• Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences
• Stability of the potential function
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• The k-factor conjecture is true
• The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences
• 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

Cited in

(7)

• A new lower bound on the potential-Ramsey number of two graphs
• Stability of the potential function
• A note on the potential function of an arbitrary graph H
• 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
• On the potential function ( H , m , n ) of an arbitrary bipartite graph H
• A note on the stability of the potential function

This page was built for publication: On the potential function of an arbitrary graph \(H\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297918)