The following pages link to Extremal Numbers for Odd Cycles (Q5364245):
Displaying 26 items.
- Spectral extrema of graphs: forbidden hexagon (Q785828) (← links)
- Triangle-free graphs with the maximum number of cycles (Q898130) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- An Erdős-Gallai type theorem for vertex colored graphs (Q2000563) (← links)
- A spectral condition for the existence of a pentagon in non-bipartite graphs (Q2041769) (← links)
- On the Turán number of theta graphs (Q2053683) (← links)
- The Turán number of the square of a path (Q2057579) (← links)
- Extremal graphs for two vertex-disjoint copies of a clique (Q2117533) (← links)
- Adjacency eigenvalues of graphs without short odd cycles (Q2237217) (← links)
- A spectral condition for odd cycles in non-bipartite graphs (Q2238862) (← links)
- The Turán number of disjoint copies of paths (Q2374168) (← links)
- Large induced subgraphs with three repeated degrees (Q2689512) (← 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)
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs (Q6081589) (← links)
- (Q6090845) (← links)
- Maximizing the degree powers of graphs with fixed size (Q6180639) (← links)
- Extremal results for \(C_3^-\)-free signed graphs (Q6184913) (← links)
- Spectral extrema of graphs with fixed size: forbidden triangles and pentagons (Q6589128) (← links)
- Extremal graphs for the odd prism (Q6635109) (← links)
- Spectral extremal problem on \(t\) copies of \(\ell\)-cycles (Q6635172) (← links)
- Turán number of two vertex-disjoint copies of cliques. (Q6648066) (← links)
- Turán problem of signed graph for negative odd cycle (Q6657274) (← links)
- On generalized Turán numbers of intersecting cliques (Q6661725) (← links)
- Extremal graphs for the suspension of edge-critical graphs (Q6671587) (← links)
