A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(k) − E). In this paper we define a bi-regular hypergraph and prove that there exists a bi-regular self-complementary 3-uniform hypergraph on n vertices if and only if n is congruent to 0 or 2 modulo 4. We also prove that there exists a quasi regular self-complementary 3-uniform hypergraph on n vertices if and only if n is congruent to 0 modulo 4
AbstractFor an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a cons...
Abstract. Extremal problems for 3-uniform hypergraphs are known to be very difficult and despite con...
ABSTRACT: Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0() to be t...
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is co...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, cal...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, ca...
Graphs and AlgorithmsA k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it...
We prove that a permutation theta is complementing permutation for a 4-uniform hypergraph if and onl...
AbstractIn 2007, Szymański and Wojda proved that for positive integers n,k with k≤n, a self-compleme...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if
A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its comp...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}...
Abstract. We prove that a permutation θ is complementing permutation for a 4-uniform hypergraph if a...
In this thesis, we survey the current research into self-complementary hypergraphs, and present sev...
AbstractFor an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a cons...
Abstract. Extremal problems for 3-uniform hypergraphs are known to be very difficult and despite con...
ABSTRACT: Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0() to be t...
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is co...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, cal...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, ca...
Graphs and AlgorithmsA k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it...
We prove that a permutation theta is complementing permutation for a 4-uniform hypergraph if and onl...
AbstractIn 2007, Szymański and Wojda proved that for positive integers n,k with k≤n, a self-compleme...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if
A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its comp...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}...
Abstract. We prove that a permutation θ is complementing permutation for a 4-uniform hypergraph if a...
In this thesis, we survey the current research into self-complementary hypergraphs, and present sev...
AbstractFor an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a cons...
Abstract. Extremal problems for 3-uniform hypergraphs are known to be very difficult and despite con...
ABSTRACT: Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0() to be t...