相关论文: A note on maximum size of Berge-$C_4$-free hypergr…

A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices in the two parts. The perfect matching condition and…

P. Erd\H{o}s, J. Pach, R. Pollack, and Z. Tuza [J. Combin. Theory, B 47 (1989), 279--285] made conjectures for the maximum diameter of connected graphs without a complete subgraph $K_{k+1}$, which have order $n$ and minimum degree $\delta$.…

For a fixed set of positive integers $R$, we say $\mathcal{H}$ is an $R$-uniform hypergraph, or $R$-graph, if the cardinality of each edge belongs to $R$. For a graph $G=(V,E)$, a hypergraph $\mathcal{H}$ is called a Berge-$G$, denoted by…

How many edges can a quadrilateral-free subgraph of a hypercube have? This question was raised by Paul Erd\H{o}s about $27$ years ago. His conjecture that such a subgraph asymptotically has at most half the edges of a hypercube is still…

Let $V$ be a set of $n$ points in the plane. For each $x\in V$, let $B_x$ be the closed circular disk centered at $x$ with radius equal to the distance from $x$ to its closest neighbor. The {\it closed sphere of influence graph} on $V$ is…

A hypergraph $\mathcal{F}$ is non-trivial intersecting if every two edges in it have a nonempty intersection but no vertex is contained in all edges of $\mathcal{F}$. Mubayi and Verstra\"{e}te showed that for every $k \ge d+1 \ge 3$ and $n…

In this paper we determine all the bipartite graphs with the maximum sum of squares of degrees among the ones with a given number of vertices and edges.

Dirac proved that each $n$-vertex $2$-connected graph with minimum degree at least $k$ contains a cycle of length at least $\min\{2k, n\}$. We consider a hypergraph version of this result. A Berge cycle in a hypergraph is an alternating…

Let $P_{2,2}$ be the orientation of $C_4$ which consists of two 2-paths with the same initial and terminal vertices. In this paper, we determine the maximum size of $P_{2,2}$-free digraphs of order $n$ as well as the extremal digraphs…

We consider the next greedy randomized process for generating maximal H-free graphs: Given a fixed graph H and an integer n, start by taking a uniformly random permutation of the edges of the complete n-vertex graph. Then, construct an…

In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…

An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…

Extending several previous results we obtained nearly tight estimates on the maximum size of a clique-minor in various classes of expanding graphs. These results can be used to show that graphs without short cycles and other H-free graphs…

We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…

An $r$-uniform tight cycle of length $\ell>r$ is a hypergraph with vertices $v_1,\dots,v_\ell$ and edges $\{v_i,v_{i+1},\dots,v_{i+r-1}\}$ (for all $i$), with the indices taken modulo $\ell$. It was shown by Sudakov and Tomon that for each…

Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an $n$-vertex connected $r$-uniform hypergraph which contains no member of $\mathcal{F}$ as a…

We prove that the maximum number of edges in a 3-uniform linear hypergraph on $n$ vertices containing no 2-regular subhypergraph is $n^{1+o(1)}$. This resolves a conjecture of Dellamonica, Haxell, Luczak, Mubayi, Nagle, Person, R\"odl,…

Morris and Saxton used the method of containers to bound the number of $n$-vertex graphs with $m$ edges containing no $\ell$-cycles, and hence graphs of girth more than $\ell$. We consider a generalization to $r$-uniform hypergraphs. The…

A graph is maximal knotless if it is edge maximal for the property of knotless embedding in $R^3$. We show that such a graph has at least $\frac74 |V|$ edges, and construct an infinite family of maximal knotless graphs with $|E| <…

We address the problem of finding upper bounds on the chromatic index $q(V,E)$ of linear (and loopless) hypergraphs. The first bound we find is defined through a color-preserving group on a proper and minimally edge-colored linear…