Pages that link to "Item:Q524192"

The following pages link to On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic (Q524192):

Displaying 8 items.

• New results on degree sequences of uniform hypergraphs (Q396927) (← links)
• A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
• Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices (Q1987561) (← links)
• A new lower bound on the potential-Ramsey number of two graphs (Q2025212) (← links)
• On the potential function of an arbitrary graph \(H\) (Q2297918) (← links)
• Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
• Stability of the Potential Function (Q4684741) (← links)
• Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture (Q6162035) (← links)