A bound for \(s\)-distance permutation families and explicit Ramsey graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1333.05012
author: Gábor Hegedüs
publication date: 2016-04-18T00:00:00Z
full work available at URL: ajc v64 p347.pdf
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 6570052
zbMATH Keywords: \(s\)-distance family of permutations
MaRDI profile type: Publication
Recommended article: Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
Recommended article: On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
Recommended article: On Ramsey numbers for special complete distance graphs
Recommended article: New bounds for the distance Ramsey number
Recommended article: A bound for size Ramsey numbers of multipartite graphs
Recommended article: Q4387757
Recommended article: Unit-distance graphs, graphs on the integer lattice and a Ramsey type result
Recommended article: Bounds on Ramsey numbers of certain complete bipartite graphs
Recommended article: On the strong metric dimension of permutation graphs
title: A bound for \(s\)-distance permutation families and explicit Ramsey graphs
published in: The Australasian Journal of Combinatorics
description: scientific article; zbMATH DE number 6570052