Conjecture Is the approximation ratio for the Maximum Edge Disjoint Paths (MaxEDP) or the Maximum Integer Multiflow problem (MaxIMF) bounded by a constant in -outerplanar graphs or tree-width graphs?
Problem (2) Find a composite or which divides both (see Fermat pseudoprime) and the Fibonacci number (see Lucas pseudoprime), or prove that there is no such .
Conjecture The following statements are equivalent for every endofuncoid and a set : \item is connected regarding . \item For every there exists a totally ordered set such that , , and for every partion of into two sets , such that , we have .
A covering design, or covering, is a family of -subsets, called blocks, chosen from a -set, such that each -subset is contained in at least one of the blocks. The number of blocks is the covering’s size, and the minimum size of such a covering is denoted by .
Problem Find a closed form, recurrence, or better bounds for . Find a procedure for constructing minimal coverings.
login/create account
-spheres bound (rational) homology 
-balls?
be a matroid of rank 
, and for 
let 
be the number of closed sets of rank 
.
is unimodal. 
is a simple loopless 
always rational? 
-outerplanar graphs or tree-width graphs? 
such that every 
-vertex 
-minor-free graph has at most 
cliques? 
edges whose deletion destroys every triangle. 
and 
are 
, then 
is a sequence of elements from a multiplicative group of order 
so that 
. 
or 
which divides both 
(see 
(see ![\[ M_n = 2^p - 1 \]](/files/tex/eb18a56e5c2e8b1be6ac733d217c0c1f1a47a94e.png)
that is prime.
, every 
-diregular oriented graph on at most 
vertices has a Hamilton cycle. 
be a 
is connected regarding 
.
and a set 
:
there exists a totally ordered set 
such that 
, 
, and for every partion 
of 
into two sets 
, 
such that 
, we have ![$ X \mathrel{[ \mu]^{\ast}} Y $](/files/tex/0ef560be389646efd1fdde5ebc9afc9ac98ee64e.png)
. 
has a homomorphism to 
. 
, then 
cycles of length 
. 
-
of 
so that 
is 
-edge-connected and 
is 
-edge-connected? 
be a sequence of nonnegative integers which strictly decreases until 
.
crossings, but not with less crossings. 
so that all pairwise distances between points in 
are rational? 
covering design, or covering, is a family of 
-set, such that each 
-subset is contained in at least one of the blocks. The number of blocks is the covering’s size, and the minimum size of such a covering is denoted by 
.
. Find a procedure for constructing minimal coverings. 
? 
Drupal
CSI of Charles University