A characterization of hypergraphs which are products of a finite number of edges
نویسندگان
چکیده
We prove that a hypergraph is a product of a finite number of edges if and only if it is interval-regular, satisfies the gated-edge property and has a vertex of finite degree. As a consequence, we get a characterization of Hamming graphs.
منابع مشابه
OD-characterization of Almost Simple Groups Related to displaystyle D4(4)
Let $G$ be a finite group and $pi_{e}(G)$ be the set of orders of all elements in $G$. The set $pi_{e}(G)$ determines the prime graph (or Grunberg-Kegel graph) $Gamma(G)$ whose vertex set is $pi(G)$, the set of primes dividing the order of $G$, and two vertices $p$ and $q$ are adjacent if and only if $pqinpi_{e}(G)$. The degree $deg(p)$ of a vertex $pin pi(G)$, is the number of edges incident...
متن کاملRecognizing large-degree Intersection Graphs of Linear 3-Uniform Hypergraphs
The intersection graph or the line graph Ω(H) of a hypergraph H is defined as follows: 1) the vertices of Ω(H) are in a bijective correspondence with the edges of H, 2) two vertices are adjacent in Ω(H) if and only if the corresponding edges intersect. Characterizing and recognizing intersection graphs of hypergraphs with some additional property P is one of the central problems in intersection...
متن کاملNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کاملA characterization of shellable and sequentially Cohen-Macaulay
We consider a class of hypergraphs called hypercycles and we show that a hypercycle $C_n^{d,alpha}$ is shellable or sequentially the Cohen--Macaulay if and only if $nin{3,5}$. Also, we characterize Cohen--Macaulay hypercycles. These results are hypergraph versions of results proved for cycles in graphs.
متن کاملOn Groupoids and Hypergraphs
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (subgroupoid), and only counts transitions between colour classes (cosets). These groupoids are employed towards a generic construction method for finite hypergraphs that realise specified...
متن کامل