Triangles in graphs without bipartite suspensions

DOI10.1016/j.disc.2023.113355OpenAlexW3018486525MaRDI QIDQ2699921

Dhruv Mubayi, Sayan Mukherjee

Publication date: 20 April 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.11930

zbMATH Keywords

extremal combinatoricspaths and cyclesgeneralized Turán problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\) ⋮ Extremal numbers of hypergraph suspensions of even cycles

Cites Work

• Unnamed Item
• Unnamed Item
• A new proof of the graph removal lemma
• On the maximum number of five-cycles in a triangle-free graph
• Pentagons vs. triangles
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• The maximum number of cliques in graphs without long cycles
• Cycles of even length in graphs
• Some sharp results on the generalized Turán numbers
• Counting copies of a fixed subgraph in \(F\)-free graphs
• On extremal problems of graphs and generalized graphs
• Turan's theorem for \(k\)-graphs
• A note on the Turán function of even cycles
• Graph removal lemmas
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• Extremal problems for cycles in graphs
• A survey of Turán problems for expansions
• Unavoidable cycle lengths in graphs
• On maximal paths and circuits of graphs
• On complete subgraphs of different orders
• A note on the maximum number of triangles in a C₅‐free graph
• Triangles in an Ordinary Graph
• On a problem of K. Zarankiewicz
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Triangles in graphs without bipartite suspensions