相关论文: The k-planar crossing number of random graphs and …

The crossing number of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. A graph $G$ is $k$-crossing-critical if its crossing number is at least $k$, but if we remove any edge of $G$, its crossing…

Given a graph $G$ and $p\in [0,1]$, the random subgraph $G_p$ is obtained by retaining each edge of $G$ independently with probability $p$. We show that for every $\epsilon>0$, there exists a constant $C>0$ such that the following holds.…

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. Applying probabilistic methods, an upper bound for the…

We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\in V$ independently chooses $k$ random neighbors, making $kn$ edges in…

The $2$-layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, however, the fundamental class of $k$-planar graphs has been…

For any set $\Omega$ of non-negative integers such that $\{0,1\}\subseteq \Omega$ and $\{0,1\}\ne \Omega$, we consider a random $\Omega$-$k$-tree ${\sf G}_{n,k}$ that is uniformly selected from all connected $k$-trees of $(n+k)$ vertices…

We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…

Approximate random k-colouring of a graph G=(V,E) is a very well studied problem in computer science and statistical physics. It amounts to constructing a k-colouring of G which is distributed close to Gibbs distribution, i.e. the uniform…

We count orientations of $G(n,p)$ avoiding certain classes of oriented graphs. In particular, we study $T_r(n,p)$, the number of orientations of the binomial random graph $G(n,p)$ in which every copy of $K_r$ is transitive, and $S_r(n,p)$,…

We establish the asymptotic behaviour of $\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\in[0,1]$. In particular, we show that…

We study the $k$-core of a random (multi)graph on $n$ vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used properties of empirical distributions of independent random variables…

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored the same. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…

The crossing number of a graph $G$ in a surface $\Sigma$, denoted by $cr_{\Sigma}(G)$, is the minimum number of pairwise intersections of edges in a drawing of $G$ in $\Sigma$. Let $k$ be an integer satisfying $k\geq 3$, the generalized…

We show that the twin-width of every $n$-vertex $d$-regular graph is at most $n^{\frac{d-2}{2d-2}+o(1)}$ and that almost all $d$-regular graphs attain this bound. More generally, we obtain bounds on the twin-width of sparse Erd\H{o}s-Renyi…

In this paper we asymptotically count $d$-regular $k$-uniform hypergraphs on $n$ vertices, provided $k$ is fixed and $d=d(n)=o(n^{1/2})$. In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.

A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with…

A key concept for many graph layout algorithms is planarity, a graph property that allows to draw vertices and edges crossing-free in the plane. Important is the generalization to $k$-planar graphs, which can be drawn in the plane with at…

A "book" with k pages consists of a straight line (the "spine") and k half-planes (the "pages"), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine,…

For graphs $F$ and $G$, let $F\to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Denote by ${\cal G}(N,p)$ the random graph space of order $N$ and edge probability $p$. Using the regularity method, one can…