Enumerating cycles in the graph of overlapping permutations

DOI10.1016/j.disc.2017.09.010zbMath1376.05070arXiv1609.02210OpenAlexW2964139813MaRDI QIDQ1685994

John Asplund, N. Bradley Fox

Publication date: 20 December 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cyclesclosed walksoverlapping permutations

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

The feasible region for consecutive patterns of permutations is a cycle polytope ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope

Cites Work

• Unnamed Item
• Number of cycles in the graph of 312-avoiding permutations
• Patterns in permutations and words.
• Universal cycles for permutations
• Universal cycles for combinatorial structures
• On uniquely \(k\)-determined permutations
• s-Overlap Cycles for Permutations

This page was built for publication: Enumerating cycles in the graph of overlapping permutations