On a problem of K. Zarankiewicz
T. Kóvari,V. T. Sós,Paul Turán +2 more
About: This article is published in Colloquium Mathematicum. The article was published on 01 Jan 1954. and is currently open access. The article focuses on the topics: Extremal combinatorics & Zarankiewicz problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A counterexample to sparse removal
Craig Timmons,Jacques Verstraëte +1 more
TL;DR: The Turan number of a graph H, denoted ex ( n, H ) , is the maximum number of edges in an n -vertex graph with no subgraph isomorphic to H .
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
TL;DR: Extremal Graph Theory is a very deep and wide area of modern combinatorics as mentioned in this paper and it is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which are new breakthrough results, or which, for some other reasons, are very close to us.
18
Problems and results in extremal combinatorics-II
TL;DR: Extremal combinatorics is one of the central areas in Discrete Mathematics as mentioned in this paper and deals with problems that are often motivated by questions arising in other areas, including Theoretical Computer Scien...
18
The size-Ramsey number of powers of bounded degree trees
Sören Berger,Yoshiharu Kohayakawa,Giulia Satiko Maesaka,Taísa Martins,Walner Mendonça,Guilherme Oliveira Mota,Olaf Parczyk +6 more
TL;DR: The size Ramsey number of graphs with bounded treewidth and bounded degree was shown to be linear in this article for any positive integer k and positive integer s, where k is the number of vertices in a tree.
18
Homomorphisms in Graph Property Testing
Noga Alon,Asaf Shapira +1 more
- 01 Jan 2006
TL;DR: A survey of recent results on testing graph properties finds that a common thread in all the results surveyed is that they rely heavily on the simple yet useful notion of graph homomorphism.
18