The following pages link to (Q3852213):
Displaying 50 items.
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- On the maximum size of connected hypergraphs without a path of given length (Q724883) (← links)
- On the multi-colored Ramsey numbers of paths and even cycles (Q727052) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Connected graphs without long paths (Q941391) (← links)
- The spectral radius of graphs without paths and cycles of specified length (Q962114) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs (Q1981694) (← links)
- Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
- Connected hypergraphs without long Berge-paths (Q2033897) (← links)
- On the Turán number of theta graphs (Q2053683) (← links)
- The Turán number of the square of a path (Q2057579) (← links)
- Planar Turán numbers on short cycles of consecutive lengths (Q2079819) (← links)
- The structure of graphs with given lengths of cycles (Q2092440) (← links)
- Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
- Inverse Turán numbers (Q2113336) (← links)
- Extremal graphs for two vertex-disjoint copies of a clique (Q2117533) (← links)
- The Turán numbers of special forests (Q2127719) (← links)
- Extremal graphs for the distinguishing index (Q2142642) (← links)
- Extremal graphs of the \(p\)th power of paths (Q2143414) (← links)
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
- On \(r\)-uniform hypergraphs with circumference less than \(r\) (Q2309554) (← links)
- The Turań number of \(2P_7\) (Q2312054) (← links)
- Avoiding long Berge cycles (Q2312601) (← links)
- On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
- Multicolour Ramsey numbers of paths and even cycles (Q2357225) (← links)
- The Turán number of disjoint copies of paths (Q2374168) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574) (← links)
- Extremal Numbers for Odd Cycles (Q5364245) (← links)
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs (Q6046685) (← links)
- Outerplanar Turán numbers of cycles and paths (Q6056741) (← links)
- Turán numbers for disjoint paths (Q6056755) (← links)
- Extremal Problems for Hypergraph Blowups of Trees (Q6057807) (← 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)
- The bipartite Turán number and spectral extremum for linear forests (Q6178775) (← links)
- On Turán problems with bounded matching number (Q6201023) (← links)
- Stability of extremal connected hypergraphs avoiding Berge-paths (Q6201910) (← links)
- The complete value of the Turán number of \(3K_{p+1}\) (Q6204352) (← links)
- How connectivity affects the extremal number of trees (Q6500097) (← links)
- A stability result of the Pósa lemma (Q6552474) (← links)
- Extremal graphs without long paths and large cliques (Q6563991) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
- The Turán number of \(P_9 \cup P_7\) (Q6569093) (← 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)
