Loading [MathJax]/jax/output/CommonHTML/jax.js
Seminars
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Calendar
Search
Add a seminar

RSS
Forthcoming seminars




Knots and Representation Theory
November 29, 2021 18:30, Moscow
 


Some new Turan type theorems

Gyula O.H. Katona

Number of views:
This page:125

Abstract: Mantel proved in 1907 that if a graph G with n vertices contains no triangle then the number of its edges is at most n24. The optimal graph is a complete bipartite graph with equal parts. In 1941 Turan found a generalization: if G contains no copy of the complete graph Kk+1 then the number of its edges is not more than the complete k-partite graph with k equal parts has. In general a Turan type problem asks for the maximum number of edges in a graph G with n vertices containing no copy of a “small” given graph H. This maximum is denoted by ex(n,H). Mantel’s and Turan’s theorems determined ex(n,K3) and ex(n,Kk+1), respectively. Rademacher observed that if G has ex(n,K3)+1 edges then there are suddenly at least n2 triangles, not only one. We prove a strengthening of this statement, namely if the number of edges is ex(n,K3)+1 and no vertex pins down all triangles then their number is at least n2.
Let Pk denote a path of k vertices. Erd˝os and Gallai determined ex(n,Pk). Our new result gives the solution of the combined problem: we found ex(n,{Km,Pk}) for large n.
The results are jointly achieved with Chuanqi Xiao.

Language: English
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025