相关论文: New bounds on even cycle creating Hamiltonian path…

According to a conjecture of Pach, there are $O(n)$ tangent pairs among any family of $n$ Jordan arcs in which every pair of arcs has precisely one common point and no three arcs share a common point. This conjecture was proved for two…

We show that for every integer $n\geq 1$ there exists a graph $G_n$ with $(1+o(1))n$ vertices and $n^{1 + o(1)}$ edges such that every $n$-vertex planar graph is isomorphic to a subgraph of $G_n$. The best previous bound on the number of…

We present an algorithm which can generate all pairwise non-isomorphic $K_2$-hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, of a given order. We…

Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let $0<p<1$ be constant and let $G\sim G_{n,p}$. Let $odd(G)$ be the…

The Erd\H{o}s--Gallai Theorem states that for $k\geq 3$ every graph on $n$ vertices with more than $\frac{1}{2}(k-1)(n-1)$ edges contains a cycle of length at least $k$. Kopylov proved a strengthening of this result for 2-connected graphs…

One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to $H$ have treewidth at most $f(H)$. A lower bound for ${f(H)}$ can be…

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the…

We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform Ramsey number $r_4(5,n)$, and the same for the iterated $(k-4)$-fold logarithm of the $k$-uniform…

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

Given graphs $G$ and $H$, the generalized Tur\'{a}n number ${\rm ex}(G,H)$ is the maximum number of edges in an $H$-free subgraph of $G$. In this paper, we obtain an asymptotic upper bound on ${\rm ex}(CT_n,C_{2l})$ for any $n \ge 3$ and…

A two-coloring of the vertices $V$ of the hypergraph $H=(V, E)$ by red and blue has discrepancy $d$ if $d$ is the largest difference between the number of red and blue points in any edge. Let $f(n)$ be the fewest number of edges in an…

A Berge-path of length $k$ in a hypergraph $\mathcal{H}$ is a sequence $v_1,e_1,v_2,e_2,\dots,v_{k},e_k,v_{k+1}$ of distinct vertices and hyperedges with $v_{i},v_{i+1} \in e_i$, for $i \le k$. F\"uredi, Kostochka and Luo, and independently…

Let $G$ be an $n$-vertex graph obtained by adding chords to a cycle of length $n$. Markstr\"{o}m asked for the maximum number of edges in $G$ if there are no two cycles in $G$ with the same length. A simple counting argument shows that such…

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…

An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line…

Given a graph $F$, a Berge copy of $F$ (Berge-$F$ for short) is a hypergraph obtained by enlarging the edges arbitrarily. Gy\H{o}ri, Salia and Zamora determined the maximum number of hyperedges in a connected $r$-uniform hypergraph on $n$…

A graph $H$ is \emph{common} if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring, or equivalently, $t_H(W)+t_H(1-W)\geq 2^{1-e(H)}$ holds for…

A proper total colouring of a graph $G$ is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colours, then no pair of colours appears twice. The smallest…

For all integers $k$ with $k\geq 2$, if $G$ is a balanced $k$-partite graph on $n\geq 3$ vertices with minimum degree at least \[…

Let $G$ be a graph and $\gamma (G)$ denote the domination number of $G$, i.e. the cardinality of a smallest set of vertices $S$ such that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. Matheson and Tarjan conjectured…