A Dimension 6 Graph with Minimum Edge-set
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-017-1854-8
Abstract: The dimension of a graph G is defined to be the minimum n such that G has a representation as a unit-distance graph in $${{\mathbb {R}}}^n$$Rn. In this article, we show that a dimension 6… read more here.
Keywords: minimum edge; graph minimum; graph; dimension graph ... See more keywords
On cycle decompositions of complete 3-uniform hypergraphs
Sign Up to like & getrecommendations! Published in 2025 at "Filomat"
DOI: 10.2298/fil2505683s
Abstract: The complete 3-uniform hypergraph K(3)n of order n has a set V of cardinality n as its vertex set and the set of all 3 element subsets of V as its edge set. For n… read more here.
Keywords: uniform hypergraphs; complete uniform; edge set; cycle decompositions ... See more keywords