首页/论文/0706.1920

arXiv 0706.19202007-06math.COmath.NT

On a problem of Duke-Erdos-Rodl on cycle-connected subgraphs

Jacob Fox, Benny Sudakov

备注：: 7 pages

英文摘要：

In this short note, we prove that for β< 1/5 every graph G with n vertices and n^{2-β} edges contains a subgraph G' with at least cn^{2-2β} edges such that every pair of edges in G' lie together on a cycle of length at most 8. Moreover edges in G' which share a vertex lie together on a cycle of length at most 6. This result is best possible up to the constant factor and settles a conjecture of Duke, Erdos, and Rodl.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

精确结果及Duke-Erdős禁止太阳花问题的极值族结构

Exact results and the structure of extremal families for the Duke--Erdős forbidden sunflower problem

本文精确解决了Duke-Erdős禁止太阳花问题的极值族结构，针对t=2、奇数s及k≥5的情况，揭示了极值族与Erdős-Rado问题的联系。

2025-11-21math.CO

关于三分之一阈值处的Duke–Erdős–Rödl问题

On the Duke--Erdős--Rödl Problem at the One-Third Threshold

Trinity College, University of Cambridge（剑桥大学三一学院）

本文在边密度ρ≥n^{-1/3}时，证明了图G包含大小为Ω(ρ^3n^2)的H_6子图（任意两边共长≤6的环）和大小为Ω(ρ^2n^2)的H_8子图（任意两边共长≤8的环），并澄清了相关条件差异。

2026-06-02cs.DMmath.COmath.PR

Resolution of the Erdős-Sauer problem on regular subgraphs

In this paper we completely resolve the well-known problem of Erdős and Sauer from 1975 which asks for the maximum number of edges an $n$-vertex graph can have without containing a $k$-regular subgraph, for some fixed integer $k\geq 3$. We prove that any $n$-vertex graph with average degree at least $C_k\log \log n$ contains a $k$-regular subgraph. This matches the lower bound of Pyber, Rödl and Szemerédi and substantially improves an old result of Pyber, who showed that average degree at least $C_k\log n$ is enough. Our method can also be used to settle asymptotically a problem raised by Erdő…

2022-08-15math.CO

Extremal problems in uniformly dense hypergraphs

For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem in extremal combinatorics. While for graphs ($k=2$) this problem is well understood, due to the work of Mantel, Turán, Erdős, Stone, Simonovits and many others, only very little is known for $k$-uniform hypergraphs for $k>2$. Already the case when $F$ is a $k$-uniform hypergraph with three edges on $k+1$ vertices is still wide open even for $k=3$. We consid…

2019-01-13math.CO

导出子图密度。I. 迈向Erdos-Hajnal猜想的一个loglog步

Induced subgraph density. I. A loglog step towards Erdos-Hajnal

本文证明了对于每个图$H$，存在$c>0$使得每个$H$-free图$G$包含大小至少为$2^{c\sqrt{\log |G|\log\log|G|}}$的团或稳定集，改进了Erdős和Hajnal于1977年的经典结果。

2024-02-19math.CO

关于Brown-Erdős-Sós问题的二次8边情形

On the quadratic 8-edge case of the Brown-Erdős-Sós problem

本文研究了Brown-Erdős-Sós问题中$k=8$的情形，确定了所有$r\ge 4$的极限值，并给出了$k=3$时的一个猜想为紧的下界。

2025-10-16math.CO

更多相关论文收起更多论文

每种密度下的规则子图

Regular subgraphs at every density

该研究解决了Erdős-Sauer问题，证明了无r-正则子图的图边数上限，并展示了在不同r范围内的一般结果。

2025-11-26math.CO

关于有界 VC 维数图的单指数 Erdős--Hajnal 界

A Single-Exponential Erdős--Hajnal Bound for Graphs of Bounded VC-Dimension

Shanghai Jiao Tong University（上海交通大学）；Hong Kong University of Science and Technology（香港科技大学）

研究有界 VC 维数图的齐次集，改进 Nguyen 等人方法，给出更精确量化界$\eta_d\geq (Cd)^{-d}$，通过直接应用 VC 维数假设优化归纳，还推导多种相关图类的定量结果。

2026-07-13math.CO

Two extensions of Ramsey's theorem

Ramsey's theorem, in the version of Erdős and Szekeres, states that every 2-coloring of the edges of the complete graph on {1, 2,...,n} contains a monochromatic clique of order 1/2\log n. In this paper, we consider two well-studied extensions of Ramsey's theorem. Improving a result of Rödl, we show that there is a constant $c>0$ such that every 2-coloring of the edges of the complete graph on \{2, 3,...,n\} contains a monochromatic clique S for which the sum of 1/\log i over all vertices i \in S is at least c\log\log\log n. This is tight up to the constant factor c and answers a question of Er…

2013-10-16cs.DMmath.CO

图的团覆盖与团的分解

Clique covers and decompositions of cliques of graphs

本文研究图的边与t顶点团的团覆盖和分解问题，证明了Erdős猜想及Dau等人猜想的分数松弛和渐近最优版本，方法结合Zykov对称化、Frankl-Rödl nibble与Szemerédi正则引理。

2026-09-16math.CO

奇围长的Erdős-Hajnal猜想

Locally bipartite subgraphs via multicolor Ramsey numbers

Department of Mathematics, ETH Zürich（苏黎世联邦理工学院数学系）

该研究针对Erdős-Hajnal猜想，改进了$f_4(k)$的上界，还证明了奇数$g\ge5$时对应函数$h_g(k)$的增长性，证实了Mohar和Wu2018年的相关猜想。

2026-09-09math.CO

关于布朗、埃尔多斯和索斯问题的$(k+2,k)$问题对于偶数整数$k$

On the $(k+2,k)$-problem of Brown, Erdős and Sós for even integers $k$

School of Mathematical Sciences, Shanghai Jiao Tong University（上海交大数学科学学院）

本文研究了$(k+2,k)$问题，确定了对于偶数$k≥4$和$r≥2+\sqrt{\frac{3}{2}k-4}$时，极限值为$\frac{1}{r^2-r}$。

2026-03-19math.CO

Uniform Turán density of cycles

In the early 1980s, Erdős and Sós initiated the study of the classical Turán problem with a uniformity condition: the uniform Turán density of a hypergraph $H$ is the infimum over all $d$ for which any sufficiently large hypergraph with the property that all its linear-size subhyperghraphs have density at least $d$ contains $H$. In particular, they raise the questions of determining the uniform Turán densities of $K_4^{(3)-}$ and $K_4^{(3)}$. The former question was solved only recently in [Israel J. Math. 211 (2016), 349-366] and [J. Eur. Math. Soc. 20 (2018), 1139-1159], while the latter sti…

2022-01-20math.CO