Hamiltonian paths, unit-interval complexes, and determinantal facet ideals

DOI10.1016/j.aam.2022.102407zbMath1496.13034arXiv2101.09243OpenAlexW3161289065WikidataQ114214497 ScholiaQ114214497MaRDI QIDQ2168562

Bruno Benedetti, Matteo Varbaro, Lisa Seccia

Publication date: 31 August 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.09243

zbMATH Keywords

Hamiltonian pathsinterval graphsbinomial edge ideals

Mathematics Subject Classification ID

Paths and cycles (05C38) Syzygies, resolutions, complexes and commutative rings (13D02) Rings with straightening laws, Hodge algebras (13F50) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

Related Items (1)

Rees algebras of unit interval determinantal facet ideals

Uses Software

• Macaulay2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularity bounds for binomial edge ideals
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• How the upper bound conjecture was proved
• Binomial edge ideals of graphs
• Loose Hamilton cycles in hypergraphs
• Square-free Gröbner degenerations
• New sufficient conditions for cycles in graphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Binomial edge ideals and conditional independence statements
• A linear time recognition algorithm for proper interval graphs
• Finding Hamiltonian circuits in proper interval graphs
• Hamiltonian cycle is polynomial on cocomparability graphs
• A method in graph theory
• A generalization of Ore's Theorem involving neighborhood unions
• Proper interval graphs and the guard problem
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Gröbner bases and Stanley decompositions of determinantal ideals
• Determinantal facet ideals
• Knutson ideals and determinantal ideals of Hankel matrices
• Non-ridge-chordal complexes whose clique complex has shellable Alexander dual
• Optimal greedy algorithms for indifference graphs
• An efficient condition for a graph to be Hamiltonian
• Incidence matrices and interval graphs
• The Roberts characterization of proper and unit interval graphs
• Pancyclic graphs. I
• On Hamilton's ideals
• Large cycles in graphs
• A decomposition theorem for partially ordered sets
• On Closed Graphs I
• Higher chordality: From graphs to complexes
• Closed graphs are proper interval graphs
• Graphs and Ideals Generated by Some 2-Minors
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• Note on Hamilton Circuits
• Representation of a finite graph by a set of intervals on the real line
• Hamiltonian graphs involving distances
• Hamiltonian chains in hypergraphs
• Weakly Closed Graphs andF-Purity of Binomial Edge Ideals
• A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
• Reducibility among Combinatorial Problems
• A class of hypergraphs that generalizes chordal graphs
• Fan type condition and characterization of Hamiltonian graphs
• On Hamiltonian Circuits in Finite Graphs
• Generically acyclic complexes and generically perfect ideals
• A Characterization of Comparability Graphs and of Interval Graphs
• Some Theorems on Abstract Graphs
• Knutson ideals of generic matrices

This page was built for publication: Hamiltonian paths, unit-interval complexes, and determinantal facet ideals