Pages that link to "Item:Q326812"
From MaRDI portal
The following pages link to Stability in the Erdős-Gallai theorems on cycles and paths (Q326812):
Displaying 23 items.
- Stability results on the circumference of a graph (Q783243) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- Erdős-Gallai stability theorem for linear forests (Q1712542) (← links)
- Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
- Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
- Extremal graphs for the distinguishing index (Q2142642) (← links)
- Extremal graphs of the \(p\)th power of paths (Q2143414) (← links)
- On \(r\)-uniform hypergraphs with circumference less than \(r\) (Q2309554) (← links)
- Stability of Woodall's theorem and spectral conditions for large cycles (Q2692178) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
- Stability version of Dirac's theorem and its applications for generalized Turán problems (Q6096834) (← links)
- The Number of Cliques in Graphs Covered by Long Cycles (Q6098464) (← links)
- The maximum number of cliques in graphs with prescribed order, circumference and minimum degree (Q6171501) (← links)
- Non-Hamiltonian graphs with large minimum degree (Q6178660) (← links)
- Stability of extremal connected hypergraphs avoiding Berge-paths (Q6201910) (← links)
- How connectivity affects the extremal number of trees (Q6500097) (← links)
- A stability result of the Pósa lemma (Q6552474) (← links)
- A note on the stability results of the number of cliques in graphs with given matching number (Q6585273) (← links)
- Stability of extremal connected hypergraphs avoiding Berge-paths (Q6604682) (← links)
- Extremal graphs for the odd prism (Q6635109) (← links)
- Linear three-uniform hypergraphs with no Berge path of given length (Q6661601) (← links)
- Circumference, minimum degree and clique number (Q6671596) (← links)