Related papers: Construction Techniques for Linear Realizations of…

Label the vertices of the complete graph $K_v$ with the integers $\{0, 1, \ldots, v-1\}$ and define the {\em length} $\ell$ of the edge between distinct vertices labeled $x$ and $y$ by $\ell(x,y) = \min( |y-x|, v - |y-x| )$. A {\em…

We propose a "Coprime Buratti-Horak-Rosa (BHR) Conjecture": If $L$ is a multiset of size $v-1$ with support contained in $\{1, 2, \ldots, \lfloor v/2 \rfloor\}$ such that $\gcd(v,x) = 1$ for all $x \in L$, then $L$ is realizable. This is a…

Label the vertices of the complete graph $K_v$ with the integers $\{ 0, 1, \ldots, v-1 \}$ and define the length of the edge between $x$ and $y$ to be $\min( |x-y| , v - |x-y| )$. Let $L$ be a multiset of size $v-1$ with underlying set…

This paper presents a comprehensive computational approach to verify and inductively construct Hamiltonian paths for the Buratti--Horak--Rosa (BHR) Conjecture. The conjecture posits that for any multiset $L$ of $p-1$ positive integers not…

The Buratti-Horak-Rosa Conjecture concerns the possible multisets of edge-labels of a Hamiltonian path in the complete graph with vertex labels $0, 1, \ldots, {v-1}$ under a particular induced edge-labeling. The conjecture has been shown to…

The conjecture, still widely open, posed by Marco Buratti, Peter Horak and Alex Rosa states that a list $L$ of $v-1$ positive integers not exceeding $\left\lfloor \frac{v}{2}\right\rfloor$ is the list of edge-lengths of a suitable…

The conjecture of Peter Horak and Alex Rosa (generalizing that of Marco Buratti) states that a multiset L of v-1 positive integers not exceeding [v/2] is the list of edge-lengths of a suitable Hamiltonian path of the complete graph with…

In this paper we investigate a problem proposed by Marco Buratti, Peter Horak and Alex Rosa (denoted by BHR-problem) concerning Hamiltonian paths in the complete graph with prescribed edge-lengths. In particular we solve BHR({1^a,2^b,t^c})…

A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear ``local constraint'' codes to be associated with the edges…

An $\mathbb{F}_q$-linear set of rank $k$ on a projective line $\mathrm{PG}(1,q^h)$, containing at least one point of weight one, has size at least $q^{k-1}+1$ (see [J. De Beule and G. Van De Voorde, The minimum size of a linear set, J.…

We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control…

For any set $S$ of positive integers, a mixed hypergraph ${\cal H}$ is a realization of $S$ if its feasible set is $S$, furthermore, ${\cal H}$ is a one-realization of $S$ if it is a realization of $S$ and each entry of its chromatic…

An $r$-uniform hypergraph ($r$-graph for short) is called linear if every pair of vertices belong to at most one edge. A linear $r$-graph is complete if every pair of vertices are in exactly one edge. The famous Brown-Erd\H{o}s-S\'os…

For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…

Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…

Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…

A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…

The notion of linear K-system is introduced by the present authors as an abstract model arising from the structure of compactified moduli spaces of solutions to Floer's equation in the book [FOOO14]. The purpose of the present article is to…

For $k\ge 3$ and $\epsilon>0$, let $H$ be a $k$-partite $k$-graph with parts $V_1,\dots, V_k$ each of size $n$, where $n$ is sufficiently large. Assume that for each $i\in [k]$, every $(k-1)$-set in $\prod_{j\in [k]\setminus \{i\}} V_i$…

In 1985, Chv\'{a}tal introduced the concept of star cutsets as a means to investigate the properties of perfect graphs, which inspired many researchers to study cutsets with some specific structures, for example, star cutsets, clique…