Permutation Inequalities for Walks in Graphs

2023/03/26 by Nadja Willenborg, Willenborg, Nadja, Sven Kosub +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Algebraic Geometry (math.AG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2303.14810

openalex publication_date 2023/03/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Using spectral graph theory, we show how to obtain inequalities for the number of walks in graphs from nonnegative polynomials and present a new family of such inequalities.

Related

• Pattern Avoiding Permutations as Walks
• Walks and the spectral radius of graphs
• Three Ways to Count Walks in a Digraph
• Number of paths in a graph
• Proof of the Erdős-Simonovits conjecture on walks