惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Vercel News
Vercel News
博客园 - 司徒正美
C
Check Point Blog
G
Google Developers Blog
The GitHub Blog
The GitHub Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
有赞技术团队
有赞技术团队
P
Proofpoint News Feed
IT之家
IT之家
B
Blog
博客园_首页
量子位
MongoDB | Blog
MongoDB | Blog
博客园 - Franky
J
Java Code Geeks
H
Help Net Security
A
About on SuperTechFans
Apple Machine Learning Research
Apple Machine Learning Research
Jina AI
Jina AI
D
DataBreaches.Net
Y
Y Combinator Blog
大猫的无限游戏
大猫的无限游戏
云风的 BLOG
云风的 BLOG
Google DeepMind News
Google DeepMind News

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Generalized Andrásfai graphs and special Betti diagrams o...
Sara Asensio, Ignacio García-Marco, Philippe Gimenez · 2026-05-12 · via math.CO updates on arXiv.org

Edge ideals of graphs were introduced by Villarreal in 1990, and have been the subject of many studies since then. In the same year, Fröberg characterized edge ideals with regularity 2 in combinatorial terms. This result was generalized by Fernández-Ramos and Gimenez to regularity 3 for bipartite graphs. A key ingredient in these results is the particular shape of the Betti diagrams of the edge ideals of the graphs obtained after removing a Hamiltonian cycle from either a complete graph $ K_k$ or a complete bipartite graph $K_{k,k}$. In this work, we consider the family of Generalized Andrásfai graphs ${\rm GA}(t,k)$ with $t\geq 1 $ and $k \geq 2$. This family extends the families of complete graphs, since $K_{k+1} = {\rm GA}(1,k)$, and complete bipartite $k$-regular graphs, since $K_{k,k} = {\rm GA}(2,k)$. We show that the results known for $ K_k$ and $ K_{k,k}$ can be naturally extended to this family. More precisely, when removing a suitable Hamiltonian cycle from ${\rm GA}(t,k)$, the resulting edge ideal has regularity $t+2$, projective dimension $t(k-2)$ and a Betti diagram exhibiting a generalized version of the same special shape.