AbstractTwo partial orders P=(X,⩽) and Q=(X, ⩽′) are complementary ifP ∩ Q={(x, x): x ε x} and the transitive closure of P ∩ Q is {(x, y : x, y ε x}. We investigate here the size ω(n) of the largest set of pairwise complementary partial orders on a set of size n. In particular, for large n we constructπ(n/log n) mutually complementary partial orders of order n, and show on the other hand that ω(n)<0.486n for all sufficiently large n. This provides an estimate of the maximum number of mutually complementaryT0 topologies on a set of size n
Maximal complements in the lattices of pre-orders and topologies.Uzcátegui Aylwin, Carlos Enrique10 ...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
AbstractTwo partial orders P=(X,⩽) and Q=(X, ⩽′) are complementary ifP ∩ Q={(x, x): x ε x} and the t...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
AbstractThe relationship between the number of solutions to the complementarity problem, w = Mz + q,...
AbstractAn α-balanced pair in a partially ordered set P = (X, <) is a pair (x, y) of elements of X s...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractTwo topologies τ and ρ over X are said to be complementary if τ∧ρ is the indiscrete topology...
AbstractLet r be a fixed positive integer. It is shown that, given any partial orders <1, …, <r on t...
Maximal complements in the lattices of pre-orders and topologies.Uzcátegui Aylwin, Carlos Enrique10 ...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
AbstractTwo partial orders P=(X,⩽) and Q=(X, ⩽′) are complementary ifP ∩ Q={(x, x): x ε x} and the t...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
AbstractThe relationship between the number of solutions to the complementarity problem, w = Mz + q,...
AbstractAn α-balanced pair in a partially ordered set P = (X, <) is a pair (x, y) of elements of X s...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractTwo topologies τ and ρ over X are said to be complementary if τ∧ρ is the indiscrete topology...
AbstractLet r be a fixed positive integer. It is shown that, given any partial orders <1, …, <r on t...
Maximal complements in the lattices of pre-orders and topologies.Uzcátegui Aylwin, Carlos Enrique10 ...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...