相关论文: Discrepancy of random graphs and hypergraphs

The $k$-core of a graph is the largest subgraph of minimum degree at least $k$. We show that for $k$ sufficiently large, the $(k + 2)$-core of a random graph $\G(n,p)$ asymptotically almost surely has a spanning $k$-regular subgraph. Thus…

Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a…

Given a graph $H$, a perfect $H$-factor in a graph $G$ is a collection of vertex-disjoint copies of $H$ spanning $G$. K\"uhn and Osthus showed that the minimum degree threshold for a graph $G$ to contain a perfect $H$-factor is either given…

In this note, we prove that there exists a universal constant $c=\frac{43}{50}$ such that for every $k\in \mathbb{N}$ and every $d<k/2$, every $k$-uniform hypergraph on $n$ vertices and with minimum $d$-degree at least…

A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…

In this paper, we prove that for each $d \geq 2$, the union of a $d$-regular graph with a uniformly random $2$-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Dragani\'c and Keevash for all…

Let $k,l$ be two positive integers. An $S_{k,l}$ is a graph obtained from disjoint $K_{1,k}$ and $K_{1,l}$ by adding an edge between the $k$-degree vertex in $K_{1,k}$ and the $l$-degree vertex in $K_{1,l}$. An {\em $S_{k,l}$-free} graph is…

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

The transversal number $\tau(H)$ of a hypergraph $H$ is the minimum number of vertices that intersect every edge of $H$. A linear hypergraph is one in which every two distinct edges intersect in at most one vertex. A $k$-uniform hypergraph…

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…

The $k$-sample $\mathbb{G}(k,W)$ from a graphon $W:[0,1]^2\to [0,1]$ is the random graph on $\{1,\dots,k\}$, where we sample $x_1,\dots,x_k\in [0,1]$ uniformly at random and make each pair $\{i,j\}\subseteq \{1,\dots,k\}$ an edge with…

In this paper, we consider the hypothesis testing of correlation between two $m$-uniform hypergraphs on $n$ unlabelled nodes. Under the null hypothesis, the hypergraphs are independent, while under the alternative hypothesis, the hyperdges…

We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.

We study rainbow-free colourings of $k$-uniform hypergraphs; that is, colourings that use $k$ colours but with the property that no hyperedge attains all colours. We show that $p^*=(k-1)(\ln n)/n$ is the threshold function for the existence…

Let $k$, $m$ and $r$ be three integers such that $2\leq k\leq m\leq r$. Let $G$ be a $2r$-regular, $2m$-edge-connected graph of odd order. We obtain some sufficient conditions, which guarantee $G-v$ contains a $k$-factor for all $v\in…

Let $h>w>0$ be two fixed integers. Let $\orH$ be a random hypergraph whose hyperedges are all of cardinality $h$. To {\em $w$-orient} a hyperedge, we assign exactly $w$ of its vertices positive signs with respect to the hyperedge, and the…

We proved that for every sufficiently large $n$, the complete graph $K_{2n}$ with an arbitrary edge signing $\sigma: E(K_{2n}) \to \{-1, +1\}$ admits a high discrepancy $1$-factor decomposition. That is, there exists a universal constant $c…

The $t$-e.c. and pseudo-random property are typical properties of random graphs. In this note, we study the gap between them which has not been studied well. As a main result, we give the first explicit construction of infinite families of…

An $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that $a\leq d_{H}(v)\leq b$ for each $v\in V(G)$. In this paper, we provide spectral conditions for the existence of an odd $[1,b]$-factor in a connected graph with minimum…

We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be…