Random

Unions of triangle free graphs ★★★

Author(s): Erdos; Hajnal

Problem   Does there exist a graph with no subgraph isomorphic to $ K_4 $ which cannot be expressed as a union of $ \aleph_0 $ triangle free graphs?

Keywords: forbidden subgraph; infinite graph; triangle free

Bingo Blitz Cheats Generator Unlimited No Jailbreak (Premium) ★★

Author(s):

Bingo Blitz Cheats Generator Unlimited No Jailbreak (Premium)

Keywords:

Dense rational distance sets in the plane ★★★

Author(s): Ulam

Problem   Does there exist a dense set $ S \subseteq {\mathbb R}^2 $ so that all pairwise distances between points in $ S $ are rational?

Keywords: integral distance; rational distance

Coloring random subgraphs ★★

Author(s): Bukh

If $ G $ is a graph and $ p \in [0,1] $, we let $ G_p $ denote a subgraph of $ G $ where each edge of $ G $ appears in $ G_p $ with independently with probability $ p $.

Problem   Does there exist a constant $ c $ so that $ {\mathbb E}(\chi(G_{1/2})) > c \frac{\chi(G)}{\log \chi(G)} $?

Keywords: coloring; random graph

Decomposing an eulerian graph into cycles. ★★

Author(s): Hajós

Conjecture   Every simple eulerian graph on $ n $ vertices can be decomposed into at most $ \frac{1}{2}(n-1) $ cycles.

Keywords:

The permanent conjecture ★★

Author(s): Kahn

Conjecture   If $ A $ is an invertible $ n \times n $ matrix, then there is an $ n \times n $ submatrix $ B $ of $ [A A] $ so that $ perm(B) $ is nonzero.

Keywords: invertible; matrix; permanent

Diagonal Ramsey numbers ★★★★

Author(s): Erdos

Let $ R(k,k) $ denote the $ k^{th} $ diagonal Ramsey number.

Conjecture   $ \lim_{k \rightarrow \infty} R(k,k) ^{\frac{1}{k}} $ exists.
Problem   Determine the limit in the above conjecture (assuming it exists).

Keywords: Ramsey number

Dice Dreams Cheats Generator Get Free Dice Dreams Cheats Generator 2024 (Brand New) ★★

Author(s):

Dice Dreams Cheats Generator Get Free Dice Dreams Cheats Generator 2024 (Brand New)

Keywords:

(m,n)-cycle covers ★★★

Author(s): Celmins; Preissmann

Conjecture   Every bridgeless graph has a (5,2)-cycle-cover.

Keywords: cover; cycle

Golf Battle Cheats Generator Ios and Android 2024 (Working Generator) ★★

Author(s):

Golf Battle Cheats Generator Ios and Android 2024 (Working Generator)

Keywords:

Idle Miner Tycoon Cheats Generator 2024 Free No Verification (New.updated) ★★

Author(s):

Idle Miner Tycoon Cheats Generator 2024 Free No Verification (New.updated)

Keywords:

Jurassic Park Builder Cheats Generator 2024 No Human Verification (Real) ★★

Author(s):

Jurassic Park Builder Cheats Generator 2024 No Human Verification (Real)

Keywords:

Davenport's constant ★★★

Author(s):

For a finite (additive) abelian group $ G $, the Davenport constant of $ G $, denoted $ s(G) $, is the smallest integer $ t $ so that every sequence of elements of $ G $ with length $ \ge t $ has a nontrivial subsequence which sums to zero.

Conjecture   $ s( {\mathbb Z}_n^d) = d(n-1) + 1 $

Keywords: Davenport constant; subsequence sum; zero sum

Circular coloring triangle-free subcubic planar graphs ★★

Author(s): Ghebleh; Zhu

Problem   Does every triangle-free planar graph of maximum degree three have circular chromatic number at most $ \frac{20}{7} $?

Keywords: circular coloring; planar graph; triangle free

Diophantine quintuple conjecture ★★

Author(s):

Definition   A set of m positive integers $ \{a_1, a_2, \dots, a_m\} $ is called a Diophantine $ m $-tuple if $ a_i\cdot a_j + 1 $ is a perfect square for all $ 1 \leq i < j \leq m $.
Conjecture  (1)   Diophantine quintuple does not exist.

It would follow from the following stronger conjecture [Da]:

Conjecture  (2)   If $ \{a, b, c, d\} $ is a Diophantine quadruple and $ d > \max \{a, b, c\} $, then $ d = a + b + c + 2bc + 2\sqrt{(ab+1)(ac+1)(bc+1)}. $

Keywords:

War Dragons Rubies Cheats Generator 2024 (improved version) ★★

Author(s):

War Dragons Rubies Cheats Generator 2024 (improved version)

Keywords:

Smooth 4-dimensional Schoenflies problem ★★★★

Author(s): Alexander

Problem   Let $ M $ be a $ 3 $-dimensional smooth submanifold of $ S^4 $, $ M $ diffeomorphic to $ S^3 $. By the Jordan-Brouwer separation theorem, $ M $ separates $ S^4 $ into the union of two compact connected $ 4 $-manifolds which share $ M $ as a common boundary. The Schoenflies problem asks, are these $ 4 $-manifolds diffeomorphic to $ D^4 $? ie: is $ M $ unknotted?

Keywords: 4-dimensional; Schoenflies; sphere

Outer reloid of restricted funcoid ★★

Author(s): Porton

Question   $ ( \mathsf{RLD})_{\mathrm{out}} (f \cap^{\mathsf{FCD}} ( \mathcal{A} \times^{\mathsf{FCD}} \mathcal{B})) = (( \mathsf{RLD})_{\mathrm{out}} f) \cap^{\mathsf{RLD}} ( \mathcal{A} \times^{\mathsf{RLD}} \mathcal{B}) $ for every filter objects $ \mathcal{A} $ and $ \mathcal{B} $ and a funcoid $ f\in\mathsf{FCD}(\mathrm{Src}\,f; \mathrm{Dst}\,f) $?

Keywords: direct product of filters; outer reloid

Jurassic Park Builder Cheats Generator No Human Verification No Survey (Method 2024) ★★

Author(s):

Jurassic Park Builder Cheats Generator No Human Verification No Survey (Method 2024)

Keywords:

Hamilton cycle in small d-diregular graphs ★★

Author(s): Jackson

An directed graph is $ k $-diregular if every vertex has indegree and outdegree at least $ k $.

Conjecture   For $ d >2 $, every $ d $-diregular oriented graph on at most $ 4d+1 $ vertices has a Hamilton cycle.

Keywords:

Toon Blast Cheats Generator Android Ios 2024 Cheats Generator (improved version) ★★

Author(s):

Toon Blast Cheats Generator Android Ios 2024 Cheats Generator (improved version)

Keywords:

Number of Cliques in Minor-Closed Classes ★★

Author(s): Wood

Question   Is there a constant $ c $ such that every $ n $-vertex $ K_t $-minor-free graph has at most $ c^tn $ cliques?

Keywords: clique; graph; minor

PTAS for feedback arc set in tournaments ★★

Author(s): Ailon; Alon

Question   Is there a polynomial time approximation scheme for the feedback arc set problem for the class of tournaments?

Keywords: feedback arc set; PTAS; tournament

Cookie Run Kingdom Cheats Generator Unlimited Cheats Generator (New 2024) ★★

Author(s):

Cookie Run Kingdom Cheats Generator Unlimited Cheats Generator (New 2024)

Keywords:

Free Gardenscapes Coins Stars Cheats Pro Apk Online (2024) ★★

Author(s):

Free Gardenscapes Coins Stars Cheats Pro Apk Online (2024)

Keywords:

$C^r$ Stability Conjecture ★★★★

Author(s): Palis; Smale

Conjecture   Any $ C^r $ structurally stable diffeomorphism is hyperbolic.

Keywords: diffeomorphisms,; dynamical systems

Decomposing k-arc-strong tournament into k spanning strong digraphs ★★

Author(s): Bang-Jensen; Yeo

Conjecture   Every k-arc-strong tournament decomposes into k spanning strong digraphs.

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

Idle Miner Tycoon Cheats Generator 2023-2024 (No Human Verification) ★★

Author(s):

Idle Miner Tycoon Cheats Generator 2023-2024 (No Human Verification)

Keywords:

Ramsey properties of Cayley graphs ★★★

Author(s): Alon

Conjecture   There exists a fixed constant $ c $ so that every abelian group $ G $ has a subset $ S \subseteq G $ with $ -S = S $ so that the Cayley graph $ {\mathit Cayley}(G,S) $ has no clique or independent set of size $ > c \log |G| $.

Keywords: Cayley graph; Ramsey number

Subset-sums equality (pigeonhole version) ★★★

Author(s):

Problem   Let $ a_1,a_2,\ldots,a_n $ be natural numbers with $ \sum_{i=1}^n a_i < 2^n - 1 $. It follows from the pigeon-hole principle that there exist distinct subsets $ I,J \subseteq \{1,\ldots,n\} $ with $ \sum_{i \in I} a_i = \sum_{j \in J} a_j $. Is it possible to find such a pair $ I,J $ in polynomial time?

Keywords: polynomial algorithm; search problem

Frankl's union-closed sets conjecture ★★

Author(s): Frankl

Conjecture   Let $ F $ be a finite family of finite sets, not all empty, that is closed under taking unions. Then there exists $ x $ such that $ x $ is an element of at least half the members of $ F $.

Keywords:

Free Sims FreePlay Free Simoleons Life Points and Social Points Cheats 2024 (Safe) ★★

Author(s):

Free Sims FreePlay Free Simoleons Life Points and Social Points Cheats 2024 (Safe)

Keywords:

Odd incongruent covering systems ★★★

Author(s): Erdos; Selfridge

Conjecture   There is no covering system whose moduli are odd, distinct, and greater than 1.

Keywords: covering system

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

Finite entailment of Positive Horn logic ★★

Author(s): Martin

Question   Positive Horn logic (pH) is the fragment of FO involving exactly $ \exists, \forall, \wedge, = $. Does the fragment $ pH \wedge \neg pH $ have the finite model property?

Keywords: entailment; finite satisfiability; horn logic

A conjecture on iterated circumcentres ★★

Author(s): Goddyn

Conjecture   Let $ p_1,p_2,p_3,\ldots $ be a sequence of points in $ {\mathbb R}^d $ with the property that for every $ i \ge d+2 $, the points $ p_{i-1}, p_{i-2}, \ldots p_{i-d-1} $ are distinct, lie on a unique sphere, and further, $ p_i $ is the center of this sphere. If this sequence is periodic, must its period be $ 2d+4 $?

Keywords: periodic; plane geometry; sequence

Codes Free Star Stable Star Coins Jorvik Coins Cheats 2024 No Human Veryfication!!! ★★

Author(s):

Codes Free Star Stable Star Coins Jorvik Coins Cheats 2024 No Human Veryfication!!!

Keywords:

Sky Children of the Light Unlimited Candle Cheats (New 2024) ★★

Author(s):

Sky Children of the Light Unlimited Candle Cheats (New 2024)

Keywords:

Unsolvability of word problem for 2-knot complements ★★★

Author(s): Gordon

Problem   Does there exist a smooth/PL embedding of $ S^2 $ in $ S^4 $ such that the fundamental group of the complement has an unsolvable word problem?

Keywords: 2-knot; Computational Complexity; knot theory

Bleach Brave Souls Cheats Generator No Human Verification (Ios Android) ★★

Author(s):

Bleach Brave Souls Cheats Generator No Human Verification (Ios Android)

Keywords:

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

Stable set meeting all longest directed paths. ★★

Author(s): Laborde; Payan; Xuong N.H.

Conjecture   Every digraph has a stable set meeting all longest directed paths

Keywords:

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

Legal* Free Warzone Cheats COD points Generator No Human Verification 2024 ★★

Author(s):

Legal* Free Warzone Cheats COD points Generator No Human Verification 2024

Keywords:

Partitioning the Projective Plane ★★

Author(s): Noel

Throughout this post, by projective plane we mean the set of all lines through the origin in $ \mathbb{R}^3 $.

Definition   Say that a subset $ S $ of the projective plane is octahedral if all lines in $ S $ pass through the closure of two opposite faces of a regular octahedron centered at the origin.
Definition   Say that a subset $ S $ of the projective plane is weakly octahedral if every set $ S'\subseteq S $ such that $ |S'|=3 $ is octahedral.
Conjecture   Suppose that the projective plane can be partitioned into four sets, say $ S_1,S_2,S_3 $ and $ S_4 $ such that each set $ S_i $ is weakly octahedral. Then each $ S_i $ is octahedral.

Keywords: Partitioning; projective plane

House Of Fun Cheats Generator (iOS Android 2024) ★★

Author(s):

House Of Fun Cheats Generator (iOS Android 2024)

Keywords:

Hungry Shark Evolution Cheats Generator 2024 Working (Generator) ★★

Author(s):

Hungry Shark Evolution Cheats Generator 2024 Working (Generator)

Keywords:

Graceful Tree Conjecture ★★★

Author(s):

Conjecture   All trees are graceful

Keywords: combinatorics; graceful labeling

Are almost all graphs determined by their spectrum? ★★★

Author(s):

Problem   Are almost all graphs uniquely determined by the spectrum of their adjacency matrix?

Keywords: cospectral; graph invariant; spectrum