Random

Unfriendly partitions ★★★

Author(s): Cowan; Emerson

If $ G $ is a graph, we say that a partition of $ V(G) $ is unfriendly if every vertex has at least as many neighbors in the other classes as in its own.

Problem   Does every countably infinite graph have an unfriendly partition into two sets?

Keywords: coloring; infinite graph; partition

Transversal achievement game on a square grid ★★

Author(s): Erickson

Problem   Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an $ n \times  n $ grid. The first player (if any) to occupy a set of $ n $ cells having no two cells in the same row or column is the winner. What is the outcome of the game given optimal play?

Keywords: game

Termination of the sixth Goodstein Sequence

Author(s): Graham

Question   How many steps does it take the sixth Goodstein sequence to terminate?

Keywords: Goodstein Sequence

Sets with distinct subset sums ★★★

Author(s): Erdos

Say that a set $ S \subseteq {\mathbb Z} $ has distinct subset sums if distinct subsets of $ S $ have distinct sums.

Conjecture   There exists a fixed constant $ c $ so that $ |S| \le \log_2(n) + c $ whenever $ S \subseteq \{1,2,\ldots,n\} $ has distinct subset sums.

Keywords: subset sum

Every metamonovalued reloid is monovalued ★★

Author(s): Porton

Conjecture   Every metamonovalued reloid is monovalued.

Keywords:

Vertex Coloring of graph fractional powers ★★★

Author(s): Iradmusa

Conjecture   Let $ G $ be a graph and $ k $ be a positive integer. The $ k- $power of $ G $, denoted by $ G^k $, is defined on the vertex set $ V(G) $, by connecting any two distinct vertices $ x $ and $ y $ with distance at most $ k $. In other words, $ E(G^k)=\{xy:1\leq d_G(x,y)\leq k\} $. Also $ k- $subdivision of $ G $, denoted by $ G^\frac{1}{k} $, is constructed by replacing each edge $ ij $ of $ G $ with a path of length $ k $. Note that for $ k=1 $, we have $ G^\frac{1}{1}=G^1=G $.
Now we can define the fractional power of a graph as follows:
Let $ G $ be a graph and $ m,n\in \mathbb{N} $. The graph $ G^{\frac{m}{n}} $ is defined by the $ m- $power of the $ n- $subdivision of $ G $. In other words $ G^{\frac{m}{n}}\isdef (G^{\frac{1}{n}})^m $.
Conjecture. Let $ G $ be a connected graph with $ \Delta(G)\geq3 $ and $ m $ be a positive integer greater than 1. Then for any positive integer $ n>m $, we have $ \chi(G^{\frac{m}{n}})=\omega(G^\frac{m}{n}) $.
In [1], it was shown that this conjecture is true in some special cases.

Keywords: chromatic number, fractional power of graph, clique number

Universal highly arc transitive digraphs ★★★

Author(s): Cameron; Praeger; Wormald

An alternating walk in a digraph is a walk $ v_0,e_1,v_1,\ldots,v_m $ so that the vertex $ v_i $ is either the head of both $ e_i $ and $ e_{i+1} $ or the tail of both $ e_i $ and $ e_{i+1} $ for every $ 1 \le i \le m-1 $. A digraph is universal if for every pair of edges $ e,f $, there is an alternating walk containing both $ e $ and $ f $

Question   Does there exist a locally finite highly arc transitive digraph which is universal?

Keywords: arc transitive; digraph

Bouchet's 6-flow conjecture ★★★

Author(s): Bouchet

Conjecture   Every bidirected graph with a nowhere-zero $ k $-flow for some $ k $, has a nowhere-zero $ 6 $-flow.

Keywords: bidirected graph; nowhere-zero flow

Star chromatic index of cubic graphs ★★

Author(s): Dvorak; Mohar; Samal

The star chromatic index $ \chi_s'(G) $ of a graph $ G $ is the minimum number of colors needed to properly color the edges of the graph so that no path or cycle of length four is bi-colored.

Question   Is it true that for every (sub)cubic graph $ G $, we have $ \chi_s'(G) \le 6 $?

Keywords: edge coloring; star coloring

Circular choosability of planar graphs

Author(s): Mohar

Let $ G = (V, E) $ be a graph. If $ p $ and $ q $ are two integers, a $ (p,q) $-colouring of $ G $ is a function $ c $ from $ V $ to $ \{0,\dots,p-1\} $ such that $ q \le |c(u)-c(v)| \le p-q $ for each edge $ uv\in E $. Given a list assignment $ L $ of $ G $, i.e.~a mapping that assigns to every vertex $ v $ a set of non-negative integers, an $ L $-colouring of $ G $ is a mapping $ c : V \to N $ such that $ c(v)\in L(v) $ for every $ v\in V $. A list assignment $ L $ is a $ t $-$ (p,q) $-list-assignment if $ L(v) \subseteq \{0,\dots,p-1\} $ and $ |L(v)| \ge tq $ for each vertex $ v \in V $ . Given such a list assignment $ L $, the graph G is $ (p,q) $-$ L $-colourable if there exists a $ (p,q) $-$ L $-colouring $ c $, i.e. $ c $ is both a $ (p,q) $-colouring and an $ L $-colouring. For any real number $ t \ge 1 $, the graph $ G $ is $ t $-$ (p,q) $-choosable if it is $ (p,q) $-$ L $-colourable for every $ t $-$ (p,q) $-list-assignment $ L $. Last, $ G $ is circularly $ t $-choosable if it is $ t $-$ (p,q) $-choosable for any $ p $, $ q $. The circular choosability (or circular list chromatic number or circular choice number) of G is $$cch(G) := \inf\{t \ge 1 : G \text{ is circularly $t$-choosable}\}.$$

Problem   What is the best upper bound on circular choosability for planar graphs?

Keywords: choosability; circular colouring; planar graphs

The Crossing Number of the Complete Graph ★★★

Author(s):

The crossing number $ cr(G) $ of $ G $ is the minimum number of crossings in all drawings of $ G $ in the plane.

Conjecture   $ \displaystyle cr(K_n) =   \frac 14 \floor{\frac n2} \floor{\frac{n-1}2} \floor{\frac{n-2}2} \floor{\frac{n-3}2} $

Keywords: complete graph; crossing number

Matching cut and girth ★★

Author(s):

Question   For every $ d $ does there exists a $ g $ such that every graph with average degree smaller than $ d $ and girth at least $ g $ has a matching-cut?

Keywords: matching cut, matching, cut

Subgraph of large average degree and large girth. ★★

Author(s): Thomassen

Conjecture   For all positive integers $ g $ and $ k $, there exists an integer $ d $ such that every graph of average degree at least $ d $ contains a subgraph of average degree at least $ k $ and girth greater than $ g $.

Keywords:

Forcing a $K_6$-minor ★★

Author(s): Barát ; Joret; Wood

Conjecture   Every graph with minimum degree at least 7 contains a $ K_6 $-minor.
Conjecture   Every 7-connected graph contains a $ K_6 $-minor.

Keywords: connectivity; graph minors

Drawing disconnected graphs on surfaces ★★

Author(s): DeVos; Mohar; Samal

Conjecture   Let $ G $ be the disjoint union of the graphs $ G_1 $ and $ G_2 $ and let $ \Sigma $ be a surface. Is it true that every optimal drawing of $ G $ on $ \Sigma $ has the property that $ G_1 $ and $ G_2 $ are disjoint?

Keywords: crossing number; surface

Acyclic list colouring of planar graphs. ★★★

Author(s): Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena

Conjecture   Every planar graph is acyclically 5-choosable.

Keywords:

Cores of strongly regular graphs ★★★

Author(s): Cameron; Kazanidis

Question   Does every strongly regular graph have either itself or a complete graph as a core?

Keywords: core; strongly regular

Seymour's self-minor conjecture ★★★

Author(s): Seymour

Conjecture   Every infinite graph is a proper minor of itself.

Keywords: infinite graph; minor

Degenerate colorings of planar graphs ★★★

Author(s): Borodin

A graph $ G $ is $ k $-degenerate if every subgraph of $ G $ has a vertex of degree $ \le k $.

Conjecture   Every simple planar graph has a 5-coloring so that for $ 1 \le k \le 4 $, the union of any $ k $ color classes induces a $ (k-1) $-degenerate graph.

Keywords: coloring; degenerate; planar

Monochromatic reachability or rainbow triangles ★★★

Author(s): Sands; Sauer; Woodrow

In an edge-colored digraph, we say that a subgraph is rainbow if all its edges have distinct colors, and monochromatic if all its edges have the same color.

Problem   Let $ G $ be a tournament with edges colored from a set of three colors. Is it true that $ G $ must have either a rainbow directed cycle of length three or a vertex $ v $ so that every other vertex can be reached from $ v $ by a monochromatic (directed) path?

Keywords: digraph; edge-coloring; tournament

Mapping planar graphs to odd cycles ★★★

Author(s): Jaeger

Conjecture   Every planar graph of girth $ \ge 4k $ has a homomorphism to $ C_{2k+1} $.

Keywords: girth; homomorphism; planar graph

Nearly spanning regular subgraphs ★★★

Author(s): Alon; Mubayi

Conjecture   For every $ \epsilon > 0 $ and every positive integer $ k $, there exists $ r_0 = r_0(\epsilon,k) $ so that every simple $ r $-regular graph $ G $ with $ r \ge r_0 $ has a $ k $-regular subgraph $ H $ with $ |V(H)| \ge (1- \epsilon) |V(G)| $.

Keywords: regular; subgraph

Edge list coloring conjecture ★★★

Author(s):

Conjecture   Let $ G $ be a loopless multigraph. Then the edge chromatic number of $ G $ equals the list edge chromatic number of $ G $.

Keywords:

A diagram about funcoids and reloids ★★

Author(s): Porton

Define for posets with order $ \sqsubseteq $:

  1. $ \Phi_{\ast} f = \lambda b \in \mathfrak{B}: \bigcup \{ x \in \mathfrak{A} \mid f x \sqsubseteq b \} $;
  2. $ \Phi^{\ast} f = \lambda b \in \mathfrak{A}: \bigcap \{ x \in \mathfrak{B} \mid f x \sqsupseteq b \} $.

Note that the above is a generalization of monotone Galois connections (with $ \max $ and $ \min $ replaced with suprema and infima).

Then we have the following diagram:

What is at the node "other" in the diagram is unknown.

Conjecture   "Other" is $ \lambda f\in\mathsf{FCD}: \top $.
Question   What repeated applying of $ \Phi_{\ast} $ and $ \Phi^{\ast} $ to "other" leads to? Particularly, does repeated applying $ \Phi_{\ast} $ and/or $ \Phi^{\ast} $ to the node "other" lead to finite or infinite sets?

Keywords: Galois connections

Covering systems with big moduli ★★

Author(s): Erdos; Selfridge

Problem   Does for every integer $ N $ exist a covering system with all moduli distinct and at least equal to~$ N $?

Keywords: covering system

Chromatic number of random lifts of complete graphs ★★

Author(s): Amit

Question   Is the chromatic number of a random lift of $ K_5 $ concentrated on a single value?

Keywords: random lifts, coloring

Are there only finite Fermat Primes? ★★★

Author(s):

Conjecture   A Fermat prime is a Fermat number \[ F_n  = 2^{2^n }  + 1 \] that is prime. The only known Fermat primes are F_0 =3,F_1=5,F_2=17,F_3 =257 ,F_4=65537 It is unknown if other fermat primes exist.

Keywords:

Generalized path-connectedness in proximity spaces ★★

Author(s): Porton

Let $ \delta $ be a proximity.

A set $ A $ is connected regarding $ \delta $ iff $ \forall X,Y \in \mathscr{P} A \setminus \{ \emptyset \} : \left( X \cup Y = A \Rightarrow X \mathrel{\delta} Y \right) $.

Conjecture   The following statements are equivalent for every endofuncoid $ \mu $ and a set $ U $:
    \item $ U $ is connected regarding $ \mu $. \item For every $ a, b \in U $ there exists a totally ordered set $ P \subseteq   U $ such that $ \min P = a $, $ \max P = b $, and for every partion $ \{ X, Y \} $ of $ P $ into two sets $ X $, $ Y $ such that $ \forall x \in X, y \in Y : x < y $, we have $ X \mathrel{[ \mu]^{\ast}} Y $.

Keywords: connected; connectedness; proximity space

Three-chromatic (0,2)-graphs ★★

Author(s): Payan

Question   Are there any (0,2)-graphs with chromatic number exactly three?

Keywords:

Burnside problem ★★★★

Author(s): Burnside

Conjecture   If a group has $ r $ generators and exponent $ n $, is it necessarily finite?

Keywords:

Quartic rationally derived polynomials ★★★

Author(s): Buchholz; MacDougall

Call a polynomial $ p \in {\mathbb Q}[x] $ rationally derived if all roots of $ p $ and the nonzero derivatives of $ p $ are rational.

Conjecture   There does not exist a quartic rationally derived polynomial $ p \in {\mathbb Q}[x] $ with four distinct roots.

Keywords: derivative; diophantine; elliptic; polynomial

Gao's theorem for nonabelian groups ★★

Author(s): DeVos

For every finite multiplicative group $ G $, let $ s(G) $ ($ s'(G) $) denote the smallest integer $ m $ so that every sequence of $ m $ elements of $ G $ has a subsequence of length $ >0 $ (length $ |G| $) which has product equal to 1 in some order.

Conjecture   $ s'(G) = s(G) + |G| - 1 $ for every finite group $ G $.

Keywords: subsequence sum; zero sum

Jaeger's modular orientation conjecture ★★★

Author(s): Jaeger

Conjecture   Every $ 4k $-edge-connected graph can be oriented so that $ {\mathit indegree}(v) - {\mathit outdegree}(v) \cong 0 $ (mod $ 2k+1 $) for every vertex $ v $.

Keywords: nowhere-zero flow; orientation

Colouring the square of a planar graph ★★

Author(s): Wegner

Conjecture   Let $ G $ be a planar graph of maximum degree $ \Delta $. The chromatic number of its square is
    \item at most $ 7 $ if $ \Delta =3 $, \item at most $ \Delta+5 $ if $ 4\leq\Delta\leq 7 $, \item at most $ \left\lfloor\frac32\,\Delta\right\rfloor+1 $ if $ \Delta\ge8 $.

Keywords:

Which compact boundaryless 3-manifolds embed smoothly in the 4-sphere? ★★★

Author(s): Kirby

Problem   Determine a computable set of invariants that allow one to determine, given a compact boundaryless 3-manifold, whether or not it embeds smoothly in the 4-sphere. This should include a constructive procedure to find an embedding if the manifold is embeddable.

Keywords: 3-manifold; 4-sphere; embedding

Every metamonovalued funcoid is monovalued ★★

Author(s): Porton

Conjecture   Every metamonovalued funcoid is monovalued.

The reverse is almost trivial: Every monovalued funcoid is metamonovalued.

Keywords: monovalued

Polignac's Conjecture ★★★

Author(s): de Polignac

Conjecture   Polignac's Conjecture: For any positive even number n, there are infinitely many prime gaps of size n. In other words: There are infinitely many cases of two consecutive prime numbers with difference n.

In particular, this implies:

Conjecture   Twin Prime Conjecture: There are an infinite number of twin primes.

Keywords: prime; prime gap

Goldbach conjecture ★★★★

Author(s): Goldbach

Conjecture   Every even integer greater than 2 is the sum of two primes.

Keywords: additive basis; prime

Extension complexity of (convex) polygons ★★

Author(s):

The extension complexity of a polytope $ P $ is the minimum number $ q $ for which there exists a polytope $ Q $ with $ q $ facets and an affine mapping $ \pi $ with $ \pi(Q) = P $.

Question   Does there exists, for infinitely many integers $ n $, a convex polygon on $ n $ vertices whose extension complexity is $ \Omega(n) $?

Keywords: polytope, projection, extension complexity, convex polygon

Extremal problem on the number of tree endomorphism ★★

Author(s): Zhicong Lin

Conjecture   An endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges. Among all the $ n $ vertices' trees, the star with $ n $ vertices has the most endomorphisms, while the path with $ n $ vertices has the least endomorphisms.

Keywords:

Length of surreal product

Author(s): Gonshor

Conjecture   Every surreal number has a unique sign expansion, i.e. function $ f: o\rightarrow \{-, +\} $, where $ o $ is some ordinal. This $ o $ is the length of given sign expansion and also the birthday of the corresponding surreal number. Let us denote this length of $ s $ as $ \ell(s) $.

It is easy to prove that

$$ \ell(s+t) \leq \ell(s)+\ell(t) $$

What about

$$ \ell(s\times t) \leq \ell(s)\times\ell(t) $$

?

Keywords: surreal numbers

Realisation problem for the space of knots in the 3-sphere ★★

Author(s): Budney

Problem   Given a link $ L $ in $ S^3 $, let the symmetry group of $ L $ be denoted $ Sym(L) = \pi_0 Diff(S^3,L) $ ie: isotopy classes of diffeomorphisms of $ S^3 $ which preserve $ L $, where the isotopies are also required to preserve $ L $.

Now let $ L $ be a hyperbolic link. Assume $ L $ has the further `Brunnian' property that there exists a component $ L_0 $ of $ L $ such that $ L \setminus L_0 $ is the unlink. Let $ A_L $ be the subgroup of $ Sym(L) $ consisting of diffeomorphisms of $ S^3 $ which preserve $ L_0 $ together with its orientation, and which preserve the orientation of $ S^3 $.

There is a representation $ A_L \to \pi_0 Diff(L \setminus L_0) $ given by restricting the diffeomorphism to the $ L \setminus L_0 $. It's known that $ A_L $ is always a cyclic group. And $ \pi_0 Diff(L \setminus L_0) $ is a signed symmetric group -- the wreath product of a symmetric group with $ \mathbb Z_2 $.

Problem: What representations can be obtained?

Keywords: knot space; symmetry

Seagull problem ★★★

Author(s): Seymour

Conjecture   Every $ n $ vertex graph with no independent set of size $ 3 $ has a complete graph on $ \ge \frac{n}{2} $ vertices as a minor.

Keywords: coloring; complete graph; minor

Algebraic independence of pi and e ★★★

Author(s):

Conjecture   $ \pi $ and $ e $ are algebraically independent

Keywords: algebraic independence

Melnikov's valency-variety problem

Author(s): Melnikov

Problem   The valency-variety $ w(G) $ of a graph $ G $ is the number of different degrees in $ G $. Is the chromatic number of any graph $ G $ with at least two vertices greater than $$\ceil{ \frac{\floor{w(G)/2}}{|V(G)| - w(G)} } ~ ?$$

Keywords:

The 3n+1 conjecture ★★★

Author(s): Collatz

Conjecture   Let $ f(n) = 3n+1 $ if $ n $ is odd and $ \frac{n}{2} $ if $ n $ is even. Let $ f(1) = 1 $. Assume we start with some number $ n $ and repeatedly take the $ f $ of the current number. Prove that no matter what the initial number is we eventually reach $ 1 $.

Keywords: integer sequence

Edge Reconstruction Conjecture ★★★

Author(s): Harary

Conjecture  

Every simple graph with at least 4 edges is reconstructible from it's edge deleted subgraphs

Keywords: reconstruction

Cycle Double Covers Containing Predefined 2-Regular Subgraphs ★★★

Author(s): Arthur; Hoffmann-Ostenhof

Conjecture   Let $ G $ be a $ 2 $-connected cubic graph and let $ S $ be a $ 2 $-regular subgraph such that $ G-E(S) $ is connected. Then $ G $ has a cycle double cover which contains $ S $ (i.e all cycles of $ S $).

Keywords:

Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube ★★

Author(s): Morrison; Noel

Problem   Determine the smallest percolating set for the $ 4 $-neighbour bootstrap process in the hypercube.

Keywords: bootstrap percolation; extremal combinatorics; hypercube; percolation

Sub-atomic product of funcoids is a categorical product ★★

Author(s):

Conjecture   In the category of continuous funcoids (defined similarly to the category of topological spaces) the following is a direct categorical product:
    \item Product morphism is defined similarly to the category of topological spaces. \item Product object is the sub-atomic product. \item Projections are sub-atomic projections.

See details, exact definitions, and attempted proofs here.

Keywords: