Pages that link to "Item:Q1682216"

The following pages link to The maximum number of cliques in graphs without long cycles (Q1682216):

Displaying 44 items.

• On the maximum size of connected hypergraphs without a path of given length (Q724883) (← links)
• Berge cycles in non-uniform hypergraphs (Q783055) (← links)
• Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
• Some sharp results on the generalized Turán numbers (Q2011146) (← 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)
• Supersaturation for subgraph counts (Q2117531) (← links)
• Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
• Generalized rainbow Turán problems (Q2144330) (← links)
• Generalized Turán number for linear forests (Q2144592) (← links)
• On generalized Turán number of two disjoint cliques (Q2154554) (← 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)
• The shifting method and generalized Turán number of matchings (Q2297913) (← links)
• Avoiding long Berge cycles (Q2312601) (← links)
• Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
• On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
• A variation of a theorem by Pósa (Q2421858) (← links)
• Complete subgraphs in connected graphs and its application to spectral moment (Q2659058) (← links)
• Generalized planar Turán numbers (Q2665977) (← links)
• Triangles in graphs without bipartite suspensions (Q2699921) (← links)
• A note on the Tur\'an number of a Berge odd cycle (Q4990118) (← links)
• Tree densities in sparse graph classes (Q5046563) (← links)
• Many H-Copies in Graphs with a Forbidden Tree (Q5204067) (← links)
• Subgraph densities in a surface (Q5886343) (← links)
• The maximum number of triangles in \(F_k\)-free graphs (Q6056558) (← links)
• Ordering \(Q\)-indices of graphs: given size and circumference (Q6056721) (← 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)
• Maximum cliques in a graph without disjoint given subgraph (Q6117354) (← links)
• The maximum number of cliques in graphs with prescribed order, circumference and minimum degree (Q6171501) (← links)
• Exact generalized Turán numbers for even linear forests (Q6542010) (← links)
• A stability result of the Pósa lemma (Q6552474) (← links)
• The constructor-blocker game (Q6567845) (← links)
• Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
• A Dirac-type theorem for uniform hypergraphs (Q6580493) (← links)
• A note on the stability results of the number of cliques in graphs with given matching number (Q6585273) (← links)
• A localized approach to generalized Turán problems (Q6614190) (← links)
• The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs (Q6621215) (← links)
• The maximum number of cliques in graphs with bounded odd circumference (Q6644273) (← links)
• On generalized Turán numbers of intersecting cliques (Q6661725) (← links)
• A localized approach for Turán number of long cycles (Q6667591) (← links)