Pages that link to "Item:Q5222574"

The following pages link to Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574):

Displaying 24 items.

• Spectral extrema of graphs: forbidden hexagon (Q785828) (← links)
• Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs (Q2033928) (← links)
• A spectral condition for the existence of a pentagon in non-bipartite graphs (Q2041769) (← links)
• Generalized Turán number of even linear forests (Q2042218) (← links)
• Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
• The generalized Turán number of spanning linear forests (Q2115153) (← links)
• Spectral radius, edge-disjoint cycles and cycles of the same length (Q2138553) (← links)
• Generalized Turán number for linear forests (Q2144592) (← links)
• Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait (Q2171018) (← links)
• The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
• A spectral condition for odd cycles in non-bipartite graphs (Q2238862) (← links)
• Stability of Woodall's theorem and spectral conditions for large cycles (Q2692178) (← links)
• A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs (Q2699932) (← links)
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs (Q6046685) (← links)
• Ordering \(Q\)-indices of graphs: given size and circumference (Q6056721) (← links)
• Eigenvalues and cycles of consecutive lengths (Q6074592) (← links)
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
• The spectral radius, maximum average degree and cycles of consecutive lengths of graphs (Q6121917) (← links)
• The maximum number of cliques in graphs with prescribed order, circumference and minimum degree (Q6171501) (← links)
• Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
• The maximum number of cliques in graphs with bounded odd circumference (Q6644273) (← links)
• A localized approach for Turán number of long cycles (Q6667591) (← links)