相关论文: A combinatorial view on star moments of regular di…

Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been investigated for directed graphs. In this paper we study…

A $k$-star decomposition of a graph is a partition of its edges into $k$-stars (i.e., $k$ edges with a common vertex). The paper studies the following problem: given $k \leq d/2$, does the random $d$-regular graph have a $k$-star…

We ask the question, which oriented trees $T$ must be contained as subgraphs in every finite directed graph of sufficiently large minimum out-degree. We formulate the following simple condition: all vertices in $T$ of in-degree at least $2$…

We study $k$-star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$-regular graph model $\mathcal{G}_{n,d}$. Using the small subgraph conditioning method, we prove an…

We introduce the class $\Sigma_k(d)$ of $k$-stellated (combinatorial) spheres of dimension $d$ ($0 \leq k \leq d + 1$) and compare and contrast it with the class ${\cal S}_k(d)$ ($0 \leq k \leq d$) of $k$-stacked homology $d$-spheres. We…

In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…

In this paper, we establish local well-posedness for the Cauchy problem associated with the Korteweg-de Vries (KdV) equation on a general metric star graph. The graph comprises m + k semi-infinite edges: k negative half-lines and m positive…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

We consider two decomposition problems in directed graphs. We say that a digraph is $k$-bounded for some $k \in \mathbb{Z}_{\geq 1}$ if each of its connected components contains at most $k$ arcs. For the first problem, a directed linear…

The aim of this paper is to provide an affirmative answer to a recent question by Bubeck and Linial on the local profile of trees. For a tree $T$, let $p^{(k)}_1(T)$ be the proportion of paths among all $k$-vertex subtrees (induced…

One of the most important and useful examples in discrete geometry is a finite sequence of points on the moment curve $\gamma(t)=(t,t^2,t^3,\dots ,t^d)$ or, more generally, on a {\it strictly monotone curve} in $\mathbb R^d$. These…

Extending the well-known star-comb lemma for infinite graphs, we characterise the graphs that do not contain an infinite comb or an infinite star, respectively, attached to a given set of vertices. We offer several characterisations: in…

We define a random graph obtained via connecting each point of $\mathbb{Z}^d$ independently to a fixed number $1 \leq k \leq 2d$ of its nearest neighbors via a directed edge. We call this graph the directed $k$-neighbor graph. Two natural…

We introduce the $k$-stellated spheres and compare and contrast them with $k$-stacked spheres. It is shown that for $d \geq 2k$, any $k$-stellated sphere of dimension $d$ bounds a unique and canonically defined $k$-stacked ball. In…

Solving the classical equations of motion in general relativity recursively, we consider the metric of a spatially localized and stationary source of matter. Having in mind a star of general composition, we characterize it by means of its…

The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these…

We study star-based symmetries in uniform hypergraphs and their consequences for matrices whose entries depend only on vertex stars. Such matrices admit a deterministic decomposition into a global component and a local component supported…

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability…

In 2001 Heinrich, Novak, Wasilkowski and Wo\'zniakowski proved that the inverse of the star discrepancy satisfies $n(d,\varepsilon)\leq c_{\abs}d \varepsilon^{-2}$ by showing that there exists a set of points in $[0,1)^d$ whose…

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…