On $k$-Neighbor Separated Permutations
From MaRDI portal
Publication:5234659
DOI10.1137/17M1158744zbMath1420.05006arXiv1711.07524OpenAlexW2976686141MaRDI QIDQ5234659
No author found.
Publication date: 30 September 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.07524
Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Paths and cycles (05C38)
Related Items (2)
Large families of permutations of Zn whose pairwise sums are permutations ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs
Cites Work
- Unnamed Item
- Connector families of graphs
- Triangle-different Hamiltonian paths
- On types of growth for graph-different permutations
- Inequalities for two set systems with prescribed intersections
- On the maximum number of permutations with given maximal or minimal distance
- Triangle-intersecting families of graphs
- Degree-Doubling Graph Families
- On Families of Weakly Cross-intersecting Set-pairs
- Families of Graph-different Hamilton Paths
- On Reverse-Free Codes and Permutations
- Graph-Different Permutations
- Families of locally separated Hamilton paths
- On Additive Combinatorics of Permutations of \mathbb{Z}_n
- Path Separation by Short Cycles
- Maximum Size of Reverse-Free Sets of Permutations
- Permutation Capacities of Families of Oriented Infinite Paths
- Pairwise colliding permutations and the capacity of infinite graphs
- On generalized graphs
- Intersecting families of permutations
This page was built for publication: On $k$-Neighbor Separated Permutations
