中文
相关论文

相关论文: On the co-degree threshold for the Fano plane

200 篇论文

For a simple graph $F$, let $\mathrm{Ex}(n, F)$ and $\mathrm{Ex_{sp}}(n,F)$ denote the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral radius in an $n$-vertex graph without any copy of the…

组合数学 · 数学 2022-03-22 Jing Wang , Liying Kang , Yusai Xue

The generalized Tur\'an number $\ex(n,K_s,F)$ denotes the maximum number of copies of $K_s$ in an $n$-vertex $F$-free graph. Let $kF$ denote $k$ disjoint copies of $F$. Gerbner, Methuku and Vizer [DM, 2019, 3130-3141] gave a lower bound for…

组合数学 · 数学 2023-09-19 Fangfang Zhang , Yaojun Chen , Ervin Gyori , Xiutao Zhu

In 2016, Dowden initiated the study of planar Tur\'an-type problems, which has since attracted considerable attention. Recently, Bekos et al. proved that every $K_3$-free $1$-planar graph on $n\ge 4$ vertices has at most $3n-6$ edges. In…

组合数学 · 数学 2026-04-27 Licheng Zhang , Yuanqiu Huang , Fengming Dong

We denote by $\text{ex}(n, H, F)$ the maximum number of copies of $H$ in an $n$-vertex graph that does not contain $F$ as a subgraph. Recently, Grzesik, Gy\H{o}ri, Salia, Tompkins considered conditions on $H$ under which $\text{ex}(n, H,…

组合数学 · 数学 2022-08-01 Eng Keat Hng , Domenico Mergoni Cecchelli

For all positive integers $r\geq 3$ and $n$ such that $r^2-r$ divides $n$ and an affine plane of order $r$ exists, we construct an $r$-edge colored graph with minimum degree $(1-\frac{r-2}{r^2-r})n-2$ such that the largest monochromatic…

组合数学 · 数学 2020-06-17 Louis DeBiasio , Robert A. Krueger

We show that every $k$-uniform hypergraph on $n$ vertices whose minimum $(k-2)$-degree is at least $(5/9+o(1))n^2/2$ contains a Hamiltonian cycle. A construction due to Han and Zhao shows that this minimum degree condition is optimal. The…

组合数学 · 数学 2022-07-08 Joanna Polcyn , Christian Reiher , Vojtěch Rödl , Bjarne Schülke

A long-standing Conjecture of S. Negami states that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It is known that the Conjecture is equivalent to the fact that \emph{the graph $K_{1,2, 2, 2}$…

组合数学 · 数学 2024-12-30 Dickson Annor , Yuri Nikolayevsky , Michael Payne

We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these vertices in one of the colors is at least 2n/3. The previous best value,…

离散数学 · 计算机科学 2013-01-04 Daniel Král' , Chun-Hung Liu , Jean-Sébastien Sereni , Peter Whalen , Zelealem Yilma

Let $k \geq 3$. We prove the following three bounds for the matching number, $\alpha'(G)$, of a graph, $G$, of order $n$ size $m$ and maximum degree at most $k$. If $k$ is odd, then $\alpha'(G) \ge \left( \frac{k-1}{k(k^2 - 3)} \right) n \,…

组合数学 · 数学 2016-04-19 Michael A. Henning , Anders Yeo

Let $f_r(n,v,e)$ denote the maximum number of edges in an $r$-uniform hypergraph on $n$ vertices, in which the union of any $e$ distinct edges contains at least $v+1$ vertices. The study of $f_r(n,v,e)$ was initiated by Brown, Erd{\H{o}}s…

组合数学 · 数学 2020-10-23 Gennian Ge , Chong Shangguan

Let $G=(V,E)$ be a multigraph. The {\em cover index} $\xi(G)$ of $G$ is the greatest integer $k$ for which there is a coloring of $E$ with $k$ colors such that each vertex of $G$ is incident with at least one edge of each color. Let…

组合数学 · 数学 2019-06-18 Yan Cao , Guantao Chen , Guoli Ding , Guangming Jing , Wenan Zang

The expansion of a graph $F$, denoted by $F^3$, is the $3$-graph obtained from $F$ by adding a new vertex to each edge such that different edges receive different vertices. For large $n$, we establish tight upper bounds for: The maximum…

组合数学 · 数学 2024-10-29 Xizhi Liu , Jialei Song , Long-Tu Yuan

In this paper, we prove the canonical bundle formula for Fano type fibrations and Shokurov's conjecture on boundedness of complements for Fano type threefold pairs $(X,B)$ with fibration structures in large characteristics. In particular,…

代数几何 · 数学 2025-11-11 Xintong Jiang

In our previous work we conjectured - inspired by an algebro-geometric result of Fujita - that the height of an arithmetic Fano variety X of relative dimension $n$ is maximal when X is the projective space $\mathbb{P}^n_{\mathbb{Z}}$ over…

代数几何 · 数学 2024-03-05 Rolf Andreasson , Robert J. Berman

We study Fano threefolds with~terminal singularities admitting a "minimal" action of a finite group. We prove that under certain additional assumptions such a variety does not contain planes. We also obtain an upper bounds of the number of…

代数几何 · 数学 2019-08-14 Yuri Prokhorov

Let $G=(V,E)$ be a graph of density $p$ on $n$ vertices. Following Erd\H{o}s, \L uczak and Spencer, an $m$-vertex subgraph $H$ of $G$ is called {\em full} if $H$ has minimum degree at least $p(m - 1)$. Let $f(G)$ denote the order of a…

组合数学 · 数学 2016-10-24 Victor Falgas-Ravry , Klas Markström , Jacques Verstraëte

The purpose of this note is twofold. First, we give a quick proof of Ballico-Chiantini's theorem stating that a Fano or Calabi-Yau variety of dimension at least 4 in codimension two is a complete intersection. Second, we improve Barth-Van…

代数几何 · 数学 2024-05-21 Jinhyung Park

It was proved by J.~A.~Chen and M.~Chen that a terminal Fano $3$-fold $X$ satisfies $(-K_X)^3\geq \frac{1}{330}$. We show that a $\mathbb{Q}$-factorial terminal Fano $3$-fold $X$ with $\rho(X)=1$ and $(-K_X)^3=\frac{1}{330}$ is a weighted…

代数几何 · 数学 2025-05-08 Chen Jiang

We show that complex Fano hypersurfaces can have arbitrarily large degrees of irrationality. More precisely, if we fix a Fano index e, then the degree of irrationality of a very general complex Fano hypersurface of index e and dimension n…

代数几何 · 数学 2021-11-11 Nathan Chen , David Stapleton

The Harary-Hill Conjecture states that for $n\geq 3$ every drawing of $K_n$ has at least \begin{align*} H(n) :=…

计算几何 · 计算机科学 2018-07-12 Petra Mutzel , Lutz Oettershagen