Planar polynomials and an extremal problem of Fischer and Matoušek

DOI10.1016/j.jctb.2017.08.001zbMath1375.05066arXiv1702.01357OpenAlexW2587201385MaRDI QIDQ1682210

Rex W. Matthews, Robert S. Coulter, Craig Timmons

Publication date: 28 November 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

extremal graph theorymaximizing copies of \(K_3\)planar polynomials

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Turán numbers of bipartite graphs plus an odd cycle
• A counterexample to sparse removal
• Planar functions and planes of Lenz-Barlotti class II
• On the maximum number of five-cycles in a triangle-free graph
• Pentagons vs. triangles
• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• On the number of pentagons in triangle-free graphs
• Planes of order \(n\) with collineation groups of order \(n^ 2\)
• The Difference Between Consecutive Primes, II
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• A lower bound for families of Natarajan dimension \(d\)
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Planar polynomials and an extremal problem of Fischer and Matoušek