Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.23231

Perfecting the Line Graph

Hartosh Singh Bal
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the doubled edge-stage lift \[ \HL'_2(G)=L(G\otimes K_2), \] the line graph of the canonical bipartite double cover of a graph \(G\). The natural involution \((u,v)\leftrightarrow(v,u)\) has quotient isomorphic to \(L(G)\), and induces a sector decomposition \[ \Spec(\HL'_2(G))=\Spec(L(G))\cup\Spec(\mathcal A(G)), \] where \(\mathcal A(G)\) is a canonical signed refinement of the line graph. Thus the construction retains substantial edge-space information through its quotient and antisymmetric sector. For every input graph, \(\HL'_2(G)\) is perfect, claw-free, and box-perfect. In the regular case we give an explicit spectral formula, together with quantitative control of the second eigenvalue and spectral gap for non-bipartite input. Explicit families, including the complete-graph lifts and the Paley lifts, illustrate the theory; in particular, the Paley lifts furnish an explicit family of regular perfect graphs with controlled adjacency spectrum and spectral gap. The construction may be viewed both intrinsically, via ordered-edge adjacency by one-coordinate agreement, and extrinsically, as the line graph of the canonical double cover. The first viewpoint emphasizes the edge-stage nature of the lift, while the second supplies the structural proofs used here.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hartosh Singh Bal. 2026-04-17. Perfecting the Line Graph. https://arxiv.org/abs/2507.23231

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗