Searcharxiv⌕ Search

arXiv subjects

Artem Hak

Publications and source records attributed to Artem Hak.

5 recordsLinked to original sources

Triameter, distance packings, and vertex connectivity

We study upper bounds for the triameter of a connected graph in terms of distance packings and vertex connectivity. For any positive integer $k$, we bound the triameter of a graph by a linear function of its $k$-packing number and show that this bound is tight for all values of the parameters. As a corollary, we confirm the conjecture of Das and Abdioğlu on the upper bound for the triameter in terms of the order and the minimum degree of a graph. We also find the maximum triameter among graphs with given order and vertex connectivity, and describe the extremal graphs. Our main tool is a projection of a graph onto a spider or a unicyclic graph which preserves the distances between three prescribed vertices.

math.CO↗

There is no $8$-regular $K_3$-irregular graph

A graph is $K_3$-irregular if its vertices belong to pairwise distinct numbers of triangles. We prove that no $8$-regular $K_3$-irregular graph exists, settling the last unresolved case. Following the initial discovery of such graphs for regularities $r \in \{10,11,12\}$ (Stevanović et al., 2024), our previous work (Hak et al., 2025) showed that no such graphs exist for $r \le 7$, provided the first example for $r=9$, and proved that any $8$-regular candidate must have between $17$ and $22$ vertices. We exclude these possible orders for $r=8$ by combining careful analysis of triangle degrees with integer linear programming techniques. Meanwhile, a recent construction (Zhang, 2026) established that regular $K_3$-irregular graphs do exist for all $r \ge 9$. Together with our results, this establishes that an $r$-regular $K_3$-irregular graph exists if and only if $r\geq 9$.

math.CO↗

Regular $K_3$-irregular graphs

We address the problem proposed by Chartrand, Erdős and Oellermann (1988) about the existence of regular $K_3$-irregular graphs. We first establish bounds on the $K_3$-degrees of such graphs and use them to prove that there are no such graphs with regularities at most $7$. For the regularity $8$, we narrow down the bounds on the order of such graphs to six possible values. We then present an explicit example of a $9$-regular $K_3$-irregular graph. Finally, we discuss an evolutionary algorithm developed to discover such graphs. Using it, we have found such graphs for consecutive regularities from $9$ to $30$.

math.CO↗

Regular $K_3$-regular graphs

We study graphs that are simultaneously regular with respect to the ordinary vertex degree and regular with respect to the triangle degree, that is, the number of triangles containing a given vertex. We call such graphs regular $K_3$-regular. We investigate the (non-)existence of regular $K_3$-regular graphs with prescribed parameters $(r_2,r_3)$, where $r_2$ is the vertex degree and $r_3$ is the triangle degree. General bounds relating vertex and edge triangle degrees are derived, and non-existence results are established for broad ranges of these parameters. Special attention is paid to Turán graphs, for which we establish uniqueness results for certain parameters. The paper concludes with a summary of admissible parameters and several open problems.

math.CO↗

A note on the triameter of graphs

In this note, we give answers to three questions from the paper [A. Das, Triameter of graphs, Discuss. Math. Graph Theory, 41 (2021), 601--616]. Namely, we obtain a tight lower bound for the triameter of trees in terms of order and number of leaves. We show that in a connected block graph any triametral triple of vertices contains a diametral pair and that any diametral pair of vertices can be extended to a triametral triple. We also present several open problems concerning the interplay between triametral triples, diametral pairs and peripheral vertices in median and distance-hereditary graphs.

math.CO↗