Path Separation by Short Cycles

DOI10.1002/jgt.22050zbMath1365.05151arXiv1501.00813OpenAlexW2963451354MaRDI QIDQ5272636

Emanuela Fachini, János Körner, Gérard D. Cohen

Publication date: 30 June 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

permutationsHamilton pathsgraph-difference

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Coding theorems (Shannon theory) (94A24)

Related Items (3)

New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ Triangle-different Hamiltonian paths ⋮ On $k$-Neighbor Separated Permutations

Cites Work

• Setwise intersecting families of permutations
• Triangle-intersecting families of graphs
• Families of Graph-different Hamilton Paths
• On Reverse-Free Codes and Permutations
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems on Structures
• Maximum Size of Reverse-Free Sets of Permutations

This page was built for publication: Path Separation by Short Cycles