A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\left({\matrix{ n \cr k \cr } } \right)$ is odd
AbstractA graph is called almost self-complementary if it is isomorphic to the graph obtained from i...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, ca...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, cal...
AbstractIn 2007, Szymański and Wojda proved that for positive integers n,k with k≤n, a self-compleme...
AbstractA graph X is called almost self-complementary if it is isomorphic to one of its almost compl...
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is co...
Graphs and AlgorithmsA k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it...
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc ...
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V ,...
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its compl...
Abstract. A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s o...
AbstractA graph is called almost self-complementary if it is isomorphic to the graph obtained from i...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, ca...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, cal...
AbstractIn 2007, Szymański and Wojda proved that for positive integers n,k with k≤n, a self-compleme...
AbstractA graph X is called almost self-complementary if it is isomorphic to one of its almost compl...
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is co...
Graphs and AlgorithmsA k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it...
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc ...
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V ,...
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its compl...
Abstract. A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s o...
AbstractA graph is called almost self-complementary if it is isomorphic to the graph obtained from i...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges...
DOI
Add to ORKG