Search arXivSearch

arXiv · 2606.28610

Chordality, syzygies, and shellability for hypergraphic analogues of interval graphs

Abstract

Interval graphs are a special class of chordal graphs, and hence have connections to commutative algebra via Fröberg's theorem that characterizes linear resolutions of squarefree quadratic ideals. In recent years, several hypergraphic analogues of interval and chordal graphs have been proposed, in part as an effort to extend Fröberg's theorem to ideals generated in higher degree. In this paper, we study two such classes from the literature, cointerval hypergraphs and underclosed complexes, and show that they are in fact equivalent up to complementation. We then consider their place in the broader theory of higher-dimensional chordality, proving that an underclosed clutter is chordal in the sense of Woodroofe. As a consequence, we answer a question of Dochtermann and Engström by showing that the associated Alexander dual complexes are vertex decomposable, implying that the corresponding circuit ideals have linear quotients. We furthermore show that these dual complexes have shellings induced by their underclosed vertex orders.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anton Dochtermann, Bennet Goeckner, Marta Pavelka. 2026-06-26. Chordality, syzygies, and shellability for hypergraphic analogues of interval graphs. https://arxiv.org/abs/2606.28610

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO