Publication date
January 2009
DOI Publisher
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona GoraAbstract
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}{k}$ is even
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}{k}$ is even
We prove that a permutation theta is complementing permutation for a 4-uniform hypergraph if and onl...
AbstractFor an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a cons...
AbstractIn this paper it is shown, using the Sieve formula, that the number of open chains of length...
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...
AbstractIn 2007, Szymański and Wojda proved that for positive integers n,k with k≤n, a self-compleme...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, cal...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, ca...
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V ,...
In this thesis, we survey the current research into self-complementary hypergraphs, and present sev...
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...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
AbstractWe prove that, with one exception, each (n,n)-graph G that is embeddable in its complement h...
We prove that a permutation theta is complementing permutation for a 4-uniform hypergraph if and onl...
AbstractFor an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a cons...
AbstractIn this paper it is shown, using the Sieve formula, that the number of open chains of length...
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...
AbstractIn 2007, Szymański and Wojda proved that for positive integers n,k with k≤n, a self-compleme...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, cal...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, ca...
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V ,...
In this thesis, we survey the current research into self-complementary hypergraphs, and present sev...
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...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
AbstractWe prove that, with one exception, each (n,n)-graph G that is embeddable in its complement h...
We prove that a permutation theta is complementing permutation for a 4-uniform hypergraph if and onl...
AbstractFor an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a cons...
AbstractIn this paper it is shown, using the Sieve formula, that the number of open chains of length...
Add to ORKG