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
Hamiltonian cycles with all small even chords
TL;DR: It is proved that there is a positive integer N such that for every graph G of even order n>=N, if the minimum degree is @d(G)>=n2+92, then G contains an ESHC.
3
•Posted Content
On anti-Ramsey numbers for complete bipartite graphs and the Turan function
Elliot Krop,Michelle York +1 more
TL;DR: In this article, the anti-Ramsey Turan function (AR(G,H) is defined as the maximum number of colors in any edge-coloring of a graph that every copy of a given copy receives the same color on at least one pair of edges.
3
•Posted Content
A note on long rainbow arithmetic progressions
TL;DR: Jungi et al. as mentioned in this paper proved that for every k = O(k 5/2+ √ ϵ)-approximation using the K\H{o}v\'{a}ri-S\'{o]s-Tur\'{ a}n theorem and Wigert's bound on the divisor function.
3
Meyniel Extremal Families of Abelian Cayley Graphs
14 Mar 2022
TL;DR: In this article , it was shown that Meyniel's conjecture is tight even for abelian Cayley graphs, where the cops try to capture a robber on the vertices of a graph.
Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations
Christian Elsholtz,David S. Gunderson +1 more
- 01 Mar 2015
TL;DR: In this article, Rivat, Sarkozy and Stewart extended their result to all non-constant completely multiplicative functions and showed that many such pairs of sets $(a, b) exist.