Pages that link to "Item:Q5189535"
From MaRDI portal
The following pages link to A General Lower Bound for Potentially <i>H</i>-Graphic Sequences (Q5189535):
Displaying 14 items.
- Graphic sequences with a realization containing intersecting cliques (Q270273) (← links)
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic (Q524192) (← links)
- A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
- Graphic sequences with a realization containing a union of cliques (Q995771) (← links)
- Graphic sequences with a realization containing a generalized friendship graph (Q998359) (← links)
- On the approximate shape of degree sequences that are not potentially \(H\)-graphic (Q1713791) (← 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)
- An Erdős-Stone Type Conjecture for Graphic Sequences (Q3439575) (← links)
- A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic (Q4898764) (← links)
- A further result on the potential-Ramsey number of G1 and G2 (Q5080786) (← links)
- A note on the potential function of an arbitrary graph H (Q5081262) (← links)
- The potential-Ramsey number of $K_n$ and $K_t^{-k}$ (Q5084258) (← links)
- Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture (Q6162035) (← links)
