Conjecture Let be a -connected cubic graph and let be a -regular subgraph such that is connected. Then has a cycle double cover which contains (i.e all cycles of ).
Conjecture For every , there exists an integer such that if is a digraph whose arcs are colored with colors, then has a set which is the union of stables sets so that every vertex has a monochromatic path to some vertex in .
Conjecture There exists an integer such that every -arc-strong digraph with specified vertices and contains an out-branching rooted at and an in-branching rooted at which are arc-disjoint.
Question Is the binary affine cube the only 3-connected matroid for which equality holds in the bound where is the circumference (i.e. largest circuit size) of ?
Conjecture There is a finite upper bound on the multiplicities of entries in Pascal's triangle, other than the number .
The number appears once in Pascal's triangle, appears twice, appears three times, and appears times. There are infinite families of numbers known to appear times. The only number known to appear times is . It is not known whether any number appears more than times. The conjectured upper bound could be ; Singmaster thought it might be or . See Singmaster's conjecture.
A nowhere-zero -flow on is an orientation of together with a function from the edge set of into the real numbers such that , for all , and . The circular flow number of is inf has a nowhere-zero -flow , and it is denoted by .
A graph with maximum vertex degree is a class 1 graph if its edge chromatic number is .
Conjecture Let be an integer and a -regular graph. If is a class 1 graph, then .
Problem Two players start at a distance of 2 on an (undirected) line (so, neither player knows the direction of the other) and both move at a maximum speed of 1. What is the infimum expected meeting time (first time when the players occupy the same point) which can be achieved assuming the two players must adopt the same strategy?
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 .
login/create account
be a 
-connected cubic graph and let 
be a 
is connected. Then 
vertices. Is it true that either 
contains a complete bipartite subgraph with bipartition 
so that 
? 
-chromatic graph on at most 
vertices, then 
. 
such that if 
is a digraph whose arcs are colored with 
and 
contains an out-branching rooted at 
the only 3-connected matroid for which equality holds in the bound 
where 
is the circumference (i.e. largest circuit size) of 
? 
, there is only a finite number of good-edge-labeling critical graphs with average degree less than 
. 
. 
appears twice, 
appears three times, and 
appears 
times. There are infinite families of numbers known to appear 
times is 
. It is not known whether any number appears more than 
. See 
rectangular 
inside an 
? 
denote the 
-dimensional cube graph. A map 
is called edge-antipodal if 
whenever 
are antipodal edges. 
and 
which are joined by a monochromatic path. 
-flow 
on 
from the edge set of 
, for all 
, and 
. The circular flow number of 
has a nowhere-zero 
, and it is denoted by 
.
be an integer and 
-regular graph. If 
. 
denote ''
divides 
''. The mimic function in number theory is defined as follows [1].
divisible by 
, the mimic function, 
, is given by,
is defined to be the mimic number of any positive integer 
. 
are invertible 
matrices with entries in 
for a prime 
, then there is a 
submatrix 
of ![$ [B_1 B_2 \ldots B_p] $](/files/tex/86661dc2948aeca789b4392c2e2a9cbf7d96f735.png)
so that 
, 
does not divide 
where 
is the Legendre symbol. 
be an elliptic curve over a number field 
. Then the order of the zeros of its 
-function, 
, at 
is the Mordell-Weil rank of 
. 
is for every sets 
and 
. 
. In other words, simplify this formula. 
be integers. Set 
and 
for 
. Eventually we have 
; put 
.
, since 
, 
, 
, 
, 
, 
, 
, 
.
.
edges whose deletion destroys every triangle. 
(first time when the players occupy the same point) which can be achieved assuming the two players must adopt the same strategy? 
be a 
.
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)
. 
Drupal
CSI of Charles University