Searcharxiv⌕ Search

arXiv subjects

Bojan Mohar

Publications and source records attributed to Bojan Mohar.

At least 19 recordsLinked to original sources

Spectral distribution for biased orientations of random graphs

We study the Hermitian adjacency matrix of the second kind for biased orientations of Erdos-Renyi random graphs. In the model $D(n,p,p')$, an edge is present with probability $p$ and, conditional on its presence, is directed from its smaller to its larger endpoint with probability $p'$. Both parameters may depend on $n$, and biased tournaments are the special case $D(n,1,p')$. We prove a global semicircle law whenever $n(p(1-p)+3p^2p'(1-p')) \to \infty$, for both the centered and the uncentered matrix, and also for the expected empirical spectral measure. Our second theorem gives the exact spectrum of the mean matrix and the limits of the extreme eigenvalues on the scale $np$, under a sufficient density assumption. The main difference from the unbiased random orientations (where $p'=1/2$) is emergence of multiple large eigenvalues. The proofs include the closed-walk counting, control of the moment variances, an explicit diagonalization of the deterministic bias, and the passage from centered to uncentered spectral measures.

math.CO↗

Four-Coloring Planar Graphs in Linear Time

The famous Four Color Theorem (4CT) states that any planar graph can be colored with four colors, but how do we find a 4-coloring? In our previous paper [FOCS'26], we presented a simple combinatorial algorithm to 4-color planar graphs in $O(n\log n)$ time. We improve it here to $O(n)$ time, which is optimal. The algorithm from our previous paper is based on proving that every planar triangulation has a linear number of reducible configurations or obstructing cycles. The bottleneck for the algorithm is that we need $O(\log n)$ Kempe changes to extend a recursive 4-coloring to the reducible configurations. Each Kempe change can involve a constant fraction of the graph and takes linear time. Here we show that all $O(\log n)$ Kempe changes can be identified and implemented in $O(n)$ time. The idea is to spend $O(n)$ time to preprocess the graph so that we can identify and simulate each good Kempe change in $O(n/\log n)$ amortized time. Thus, we implement all $O(\log n)$ Kempe changes in $O(n)$ total time. Based on this, we implement the whole 4-coloring in linear time. We note that creating such a representation for fast identification and simulation of the right Kempe changes is a challenge of data structures, unlike the previous paper that builds on a new graph theoretic understanding of reducible configurations.

cs.DS↗

Hermitian adjacency matrices with at most three distinct eigenvalues

We study oriented graphs whose Hermitian adjacency matrices of the second kind have few eigenvalues. We give a complete characterization of the oriented graphs with two distinct eigenvalues, showing that there are only four such graphs. We extend this result to mixed graphs. We show that there are infinitely many regular tournaments with three distinct eigenvalues. We extend our main results to Hermitian adjacency matrices defined over other roots of unity.

math.CO↗

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring

We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be achieved by the known proofs of the Four Color Theorem (4CT). Technically speaking, we show the following significant generalization of the 4CT: every planar triangulation contains linearly many pairwise non-touching reducible configurations or pairwise non-crossing obstructing cycles of length at most 5 (which all allow for making effective 4-coloring reductions). The known proofs of the 4CT only show the existence of a single reducible configuration or obstructing cycle in the above statement. The existence is proved using the discharging method based on combinatorial curvature. It identifies reducible configurations in parts where the local neighborhood has positive combinatorial curvature. Our result significantly strengthens the known proofs of 4CT, showing that we can also find reductions in large ``flat" parts where the curvature is zero, and moreover, we can make reductions almost anywhere in a given planar graph. This also opens possibilities for extensions to higher surfaces since we can find such flat parts in any large-width triangulation of any fixed surface. From a computational perspective, the old proofs allowed us to apply induction on a problem that is smaller by some additive constant. The inductive step took linear time, resulting in a quadratic total time. With our linear number of reducible configurations or obstructing cycles, we can reduce the problem size by a constant factor. Our inductive step takes $O(n\log n)$ time, yielding a 4-coloring in $O(n\log n)$ total time. To efficiently handle a linear number of reducible configurations, we need them to be sufficiently robust to be useful in other applications. All our reducible configurations are what is known as D-reducible.

math.CO↗

The switching conjecture for main eigenvalues is asymptotically true

An eigenvalue of a signed graph is called \emph{main} if there exists a corresponding eigenvector non-orthogonal to the all-ones vector. An important result of O'Rourke and Touri (2016) states that almost all (unsigned) graphs have all main eigenvalues. Akbari, França, Ghasemian, Javarsineh, and de Lima (2021) considered main eigenvalues of signed graphs and conjectured that for any unsigned connected graph $G \notin\{ K_2, K_4 - e\}$, there is a switching $\mathbf{s}$ such that all eigenvalues of the signed graph $G^{\mathbf{s}}$ are main. We prove two incomparable asymptotic versions of this conjecture. We show that for any graph $G$ of order $n$, there exists a switching $\mathbf{s}\in\{\pm1\}^n$ such that $G^{\mathbf{s}}$ has $n - O\!\left(\frac{n}{(\log n)^{1/4}}\right)$ main eigenvalues counted with multiplicity. Using a similar proof strategy, we also show that if $G$ has $d$ distinct eigenvalues, then there exists a switching $\mathbf{s}\in\{\pm1\}^n$ such that $G^{\mathbf{s}}$ has $d - O\!\left(\frac{d}{(\log d)^{1/4}}\right)$ main eigenvalues.

math.CO↗

Spectrally symmetric orientations of graphs

The Hermitian adjacency matrices of digraphs based on the sixth root of unity were introduced in [B. Mohar, A new kind of Hermitian matrices for digraphs, Linear Alg. Appl. (2020)]. They appear to be the most natural choice for the spectral theory of digraphs. Undirected graphs have adjacency spectrum symmetric about 0 if and only if they are bipartite. The situation is more complex for the Hermitian spectra of digraphs. In this paper we study non-bipartite oriented graphs with symmetric Hermitian spectra. Our main result concerns the extremal problem of maximizing the density of spectrally symmetric oriented graphs. The maximum possible density is shown to be between 31/36} and 10/11. Furthermore, we give a necessary condition for an oriented graph to be spectrally symmetric based on the adjacency spectrum of the underlying graph. This allows us to show that line graphs of sufficiently dense graphs do not admit spectrally symmetric orientations. We also show how to construct infinite families of spectrally symmetric graphs using 1-sums.

math.CO↗

Orthogonal signed graphs of degree 5

An orthogonal signed graph is a connected signed graph whose signed adjacency matrix has pairwise orthogonal rows. They are closely related to Hadamard matrices, maximal arrangements of equiangular lines, bipartite Ramanujan graphs, and the remarkable resolution of the Sensitivity Conjecture. Orthogonal signed graphs of degree at most 4 have been completely classified, and partial results were known for degree 5. We complete the classification of orthogonal signed graphs of maximum degree 5. We also provide several new infinite families of 6- and 8-regular orthogonal signed graphs.

math.CO↗

Stability of maximal relative projection constants

For positive integers $n\ge r$, let $λ(r,n)$ denote the \emph{maximal relative projection constant} of $r$-dimensional subspaces of $\ell_\infty^n$ and $λ(r)$ denote the \emph{maximal absolute projection constant}, respectively. It is known that for any fixed $r$, $λ(r,n)$ is a non-decreasing sequence with limit $λ(r)$ as $n\to \infty$. A natural question is whether $λ(r,n)$ stabilizes at $λ(r)$ for some $n>r$. We prove that for any fixed $r$, \[λ(r,n)=λ(r) \qquad \text{for every}\qquad n\ge 2^{r}\binom{r+1}{2}.\] This answers a question of Basso. The technique used is of independent interest.

math.FA↗

Three-edge-coloring apex cubic graphs

A graph $G$ is \emph{apex} if $G$ has a vertex $v$ such that $G-v$ is planar. We prove that every $2$-connected apex cubic graph is three-edge-colorable. This result gives the final piece of the proof for the well-known Tutte's three-edge-coloring conjecture from 1966 \cite{tutte}. The proof, as well as the result, generalizes that of the Four Color Theorem, which requires computer checks. As in the previous proof of the Four Color Theorem, the proof is constructive. More precisely, given a $2$-connected apex cubic graph $G$ on $n$ vertices, our reducibility and discharging procedure yields a three-edge-coloring of $G$ in $O(n^2)$ time. As an additional reproducibility check for our computer checks, independent implementations reconstructed from the detailed pseudocode (given in the appendix) using generative AI systems reproduced the required computational results. These reconstructions are not part of the mathematical justification of the theorem, but provide additional evidence for the reproducibility of the computations.

math.CO↗

Convex combination of first and second eigenvalues of trees

For a graph $G$, let $λ_1(G)$ and $λ_2(G)$ denote the largest and the second largest adjacency eigenvalue of $G$. The sum $λ_1(G) + λ_2(G)$ is called the \emph{spectral sum} of $G$. We investigate the spectral sum of trees of order $n$ and determine the extremal trees that attain the maximum/minimum. Moreover, for any $α\in [0,1],$ we describe the extremal trees which maximize the convex combination $αλ_1 + (1-α)λ_2$ in the class of $n$-vertex trees for sufficiently large $n$.

math.CO↗

Extremal graphs for the $k$-th eigenvalue

For a simple graph $G$ of order $n$, let $λ_1(G)\ge \cdots \ge λ_n(G)$ denote its adjacency eigenvalues. Hong's problem asks for the optimal upper bound for $λ_k(G)$. A recent theorem of Sivashankar gives, for every $k\ge3$, \[ λ_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1, \] with sharp examples arising from maximal real equiangular tight frames. In this paper, we characterize the equality case. We also obtain an explicit combinatorial description of the extremal graphs for $λ_3$ and $λ_4$.

math.CO↗

Well-quasi-order of plane minors and an application to link diagrams

A plane graph $H$ is a {\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if the plane minor relation is a well-quasi-order. We settle this in the affirmative. We also prove an additional application to knot theory. If $L$ is a link and $D$ is a link diagram, write $D\leadsto L$ if there is a sequence of crossing exchanges and smoothings that takes $D$ to a diagram of $L$. We show that, for each fixed link $L$, there is a polynomial-time algorithm that takes as input a link diagram $D$ and answers whether or not $D\leadsto L$.

math.GT↗

Short rainbow cycles in graphs and matroids

Let $G$ be a simple $n$-vertex graph and $c$ be a colouring of $E(G)$ with $n$ colours, where each colour class has size at least $2$. We prove that $(G,c)$ contains a rainbow cycle of length at most $\lceil \frac{n}{2} \rceil$, which is best possible. Our result settles a special case of a strengthening of the Caccetta-Häggkvist conjecture, due to Aharoni. We also show that the matroid generalization of our main result also holds for cographic matroids, but fails for binary matroids.

math.CO↗

Genus Polynomials of Cubic Graphs with Non-Real Roots

Given a graph $G$, its genus polynomial is $Γ_G(x) = \sum_{k\geq 0} g_k(G)x^k$, where $g_k(G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$. The Log-Concavity Genus Distribution (LCGD) Conjecture states that the genus polynomial of every graph is log-concave. It was further conjectured by Stahl that the genus polynomial of every graph has only real roots, however this was later disproved. We identify several examples of cubic graphs whose genus polynomials, in addition to having at least one non-real root, have a quadratic factor that is non-log-concave when factored over the real numbers.

math.CO↗

An improved bound for the strong clique index of graphs

For a graph $G$ with line graph $L(G)$, $χ(L(G)^2)$ and $ω(L(G)^2)$ are called the \emph{strong chromatic index} and \emph{strong clique index} of $G$, respectively. A well-known conjecture of Erdős and Nešetřil (1985) posits that $χ(L(G)^2)\le \frac{5}{4}Δ(G)^2$. Related to that, Faudree, Gyárfás, Schelp and Tuza (1990) conjectured that $ω(L(G)^2) \le \frac{5}{4}Δ(G)^2$. We show that $ω(L(G)^2) \le \frac{2607}{1987}Δ(G)^2 < \frac{21}{16}Δ(G)^2$ improving the upper bound $\frac{4}{3}Δ(G)^2$ of Faron and Postle. Indeed, we make progress towards a stronger conjecture of Faron and Postle in terms of Ore-degree. For positive integers $Δ$ and $t$, let $h_t(Δ)$ denote the smallest integer such that any graph $G$ with size at least $h_t(Δ)$ and maximum degree $Δ(G)\le Δ$, contains two edges with distance at least $t$. An old problem of Erdős and Nešetřil (1986) concerns estimating the quantity $h_t(Δ)$ and can be thought of as the edge-version of the degree-diameter problem. Chung, Gyárfás, Tuza and Trotter established the sharp inequality $h_2(Δ)\le \frac{5}{4}Δ^2+1$. We disprove two conjectures of Cambie, Cames van Batenburg, Joannis de Verclos and Kang concerning the next open case $h_3(Δ)$.

math.CO↗

Universality in minor-closed graph classes

Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). János Pach (1981) answered this question in the negative. We strengthen this result by showing that every countable graph that contains all countable planar graphs must contain (i) an infinite complete graph as a minor, and (ii) a subdivision of the complete graph $K_t$ with multiplicity $t$, for every finite $t$. On the other hand, we construct a countable graph that contains all countable planar graphs and has several key properties such as linear colouring numbers, linear expansion, and every finite $n$-vertex subgraph has a balanced separator of size $O(\sqrt{n})$. The graph is $T_6\boxtimes P_{\!\infty}$, where $T_k$ is the universal treewidth-$k$ countable graph (which we define explicitly), $P_{\!\infty}$ is the 1-way infinite path, and $\boxtimes$ denotes the strong product. More generally, for every positive integer $t$ we construct a countable graph that contains every countable $K_t$-minor-free graph and has the above key properties. Our final contribution is a construction of a countable graph that contains every countable $K_t$-minor-free graph as an induced subgraph, has linear colouring numbers and linear expansion, and contains no subdivision of the countably infinite complete graph (implying (ii) above is best possible).

math.CO↗

2-cell embeddings of cubic graphs I. The unstable dual

In this paper, the first of a two-part series, we explore 2-cell embeddings of cubic graphs, particularly those with small genus. Using local rotations, we introduce a new way of describing the space of 2-cell embeddings and their mutual relationship for any fixed (cubic) graph. We introduce the unstable dual of an embedding of a cubic graph, a subgraph of the dual graph, and describe how the genus of the corresponding embedding can be recovered from properties of the unstable dual. Finally, we characterize the unstable duals of embeddings with genus at most 2 of cubic cyclically 5-edge connected planar graphs and use these to generate those of genus 3 that have connectivity at most 2.

math.CO↗

The Dominating 4-Colour Theorem

A "dominating $K_t$-model" in a graph $G$ is a sequence $(T_1,\dots,T_t)$ of pairwise vertex-disjoint connected subgraphs of $G$, such that whenever $1\leq i<j\leq t$ every vertex in $T_j$ has a neighbour in $T_i$. Replacing "every vertex in $T_j$" by "some vertex in $T_j$" retrieves the standard definition of $K_t$-model, which is equivalent to a $K_t$-minor in $G$. We prove that every graph with no dominating $K_5$-model is $4$-colourable. This generalises and is significantly stronger than the 4-colour theorem for planar graphs or for graphs with no $K_5$-minor. It also makes progress towards Hajós' conjecture on $K_5$-subdivisions in $5$-chromatic graphs.

math.CO↗