相关论文: Counting results for sparse pseudorandom hypergrap…

The Erd\H{o}s--Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph $H$, have homogeneous sets of size significantly larger than one can generally expect to find in a…

We develop a unified approach to universality of local scaling limits for eigenvalues of random normal matrices, or equivalently for planar Coulomb gases at inverse temperature $\beta=2$. The approach is direct in that it does not rely on…

Hypergraph expanders are hypergraphs with surprising, non-intuitive expansion properties. In a recent paper, the first author gave a simple construction, which can be randomized, of $3$-uniform hypergraph expanders with polylogarithmic…

A graph $\Gamma$ is said to be universal for a class of graphs $\mathcal{H}$ if $\Gamma$ contains a copy of every $H \in \mathcal{H}$ as a subgraph. The number of edges required for a host graph $\Gamma$ to be universal for the class of…

The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total…

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

For $n\geq 3$ and $r=r(n) \geq 3$, let $\boldsymbol{k} =\boldsymbol{k}(n)=(k_1, \ldots, k_n)$ be a sequence of non-negative integers with sum $M(\boldsymbol{k})=\sum_{j=1}^{n} k_j$. We assume that $M(\boldsymbol{k})$ is divisible by $r$ for…

Let $r \geq 2$ be a fixed integer. For infinitely many $n$, let $\boldsymbol{k} = (k_1,..., k_n)$ be a vector of nonnegative integers such that their sum $M$ is divisible by $r$. We present an asymptotic enumeration formula for simple…

The K{\L}R conjecture of Kohayakawa, {\L}uczak, and R\"odl is a statement that allows one to prove that asymptotically almost surely all subgraphs of the random graph G_{n,p}, for sufficiently large p : = p(n), satisfy an embedding lemma…

For $n\geq 3$, let $r=r(n)\geq 3$ be an integer. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. In this paper, the number of linear $r$-uniform…

We study sparse hypergraphs which satisfy a mild pseudorandomness condition known as $L_p$ regularity. We prove appropriate regularity and counting lemmas, and we extend the relative removal lemma of Tao in this setting. This answers a…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…

We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…

We investigate extremal problems for quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is $(d,\eta)$-quasirandom if for any subset $X\subseteq V$ and every set of pairs $P\subseteq V\times V$ the number of pairs…

In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]$ with $m$ edges, whenever $n$ and the nullity $m-n+1$ tend to infinity. Asymptotic formulae for the number of connected $r$-uniform…

P. Erd\H{o}s [On extremal problems of graphs and generalized graphs, Israel Journal of Mathematics 2 (1964), 183-190] characterised those hypergraphs $F$ that have to appear in any sufficiently large hypergraph $H$ of positive density. We…

Let $\mathcal{G}(n,r,s)$ denote a uniformly random $r$-regular $s$-uniform hypergraph on $n$ vertices, where $s$ is a fixed constant and $r=r(n)$ may grow with $n$. An $\ell$-overlapping Hamilton cycle is a Hamilton cycle in which…

Universality, namely distributional invariance, is a well-known property for many random structures. For example, it is known to hold for a broad range of variational problems with random input. Much less is known about the algorithmic…

We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…