AbstractA k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the construction of an infinite family of finite, nonreconstructible 3-hypergraphs. We also indicate why the same techniques can likely be used to construct nonreconstructible k-hypergraphs for any k ⩾ 3
AbstractLet Ht, a t-uniform hypergraph by a pair (X, T) where X is its vertex set and T is its edge-...
AbstractGiven a finite set V, and integers k≥1 and r≥0, let us denote by A(k,r) the class of hypergr...
AbstractA finite hypergraph in which the multiplicity of edges does not exceed r is called an r-mult...
AbstractA k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the const...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
AbstractGraphs G and H are hypomorphic if there is a bijection φ: V(G) → V(H) such that G − u ≅ H − ...
AbstractWe construct three new infinite families of hypohamiltonian graphs having respectively 3k+1 ...
AbstractIn this note, we study the nonreconstructibility property through examples given by Stockmey...
AbstractA colored ((0, k)-) hypergraph is a triple, 〈Σ, V, f〉, where Σ is a set of symbols called co...
AbstractFor every cardinal α > ℵD there exists an α regular graph which is reconstructible but not e...
A finite hypergraph H is said to be linear if every pair of distinct vértices of H is in at most one...
AbstractThis note supplements an earlier paper of this author, in which the concept of a strong k-hy...
AbstractA k-hypergraph G has vertex-set V(G) and edge-set E(G) consisting of k-subsets of V(G). If u...
A Berge-path of length $k$ in a hypergraph $\mathcal{H}$ is a sequence $v_1,e_1,v_2,e_2,\dots,v_{k},...
AbstractUsing the operation of amalgamation we prove that for every k, n, p there exists a k-graph G...
AbstractLet Ht, a t-uniform hypergraph by a pair (X, T) where X is its vertex set and T is its edge-...
AbstractGiven a finite set V, and integers k≥1 and r≥0, let us denote by A(k,r) the class of hypergr...
AbstractA finite hypergraph in which the multiplicity of edges does not exceed r is called an r-mult...
AbstractA k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the const...
AbstractThe paper recalls several known results concerning reconstruction and edge-reconstruction of...
AbstractGraphs G and H are hypomorphic if there is a bijection φ: V(G) → V(H) such that G − u ≅ H − ...
AbstractWe construct three new infinite families of hypohamiltonian graphs having respectively 3k+1 ...
AbstractIn this note, we study the nonreconstructibility property through examples given by Stockmey...
AbstractA colored ((0, k)-) hypergraph is a triple, 〈Σ, V, f〉, where Σ is a set of symbols called co...
AbstractFor every cardinal α > ℵD there exists an α regular graph which is reconstructible but not e...
A finite hypergraph H is said to be linear if every pair of distinct vértices of H is in at most one...
AbstractThis note supplements an earlier paper of this author, in which the concept of a strong k-hy...
AbstractA k-hypergraph G has vertex-set V(G) and edge-set E(G) consisting of k-subsets of V(G). If u...
A Berge-path of length $k$ in a hypergraph $\mathcal{H}$ is a sequence $v_1,e_1,v_2,e_2,\dots,v_{k},...
AbstractUsing the operation of amalgamation we prove that for every k, n, p there exists a k-graph G...
AbstractLet Ht, a t-uniform hypergraph by a pair (X, T) where X is its vertex set and T is its edge-...
AbstractGiven a finite set V, and integers k≥1 and r≥0, let us denote by A(k,r) the class of hypergr...
AbstractA finite hypergraph in which the multiplicity of edges does not exceed r is called an r-mult...
DOI
Add to ORKG