Pages that link to "Item:Q1296991"
From MaRDI portal
The following pages link to On the potentially \(P_k\)-graphic sequences (Q1296991):
Displaying 21 items.
- A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
- A variation of a conjecture due to Erdös and Sós (Q1034303) (← links)
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true (Q1128134) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- On the approximate shape of degree sequences that are not potentially \(H\)-graphic (Q1713791) (← links)
- An extremal problem on the potentially \(P_k\)-graphic sequences (Q1971211) (← 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)
- An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices (Q2335676) (← links)
- Boundedness of optimal matrices in extremal multigraph and digraph problems (Q2367447) (← links)
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size (Q2581629) (← links)
- (Q3052582) (← links)
- Potentially K m — G-graphical sequences: A survey (Q3070180) (← links)
- (Q3698836) (← links)
- The smallest degree sum that yields potentially \(P_k\)-graphical sequences (Q4242917) (← links)
- (Q4460553) (← links)
- Graphic sequences that have a realization with large clique number (Q4487072) (← links)
- Graphs realizing the same degree sequences and their respective clique numbers (Q4873824) (← links)
- A General Lower Bound for Potentially <i>H</i>-Graphic Sequences (Q5189535) (← links)
- On Potentially Graphical Sequences of G−E(H) (Q5193713) (← links)
- Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture (Q6162035) (← links)
