User Thomas Lesgourgues

12 votes

Why the "self-referential number" function eventually fixes every point

answered Sep 7, 2020 at 5:54

7 votes

Accepted

Which one of these is an abelian group?

answered Oct 23, 2019 at 14:01

6 votes

Accepted

What is the math behind the zombie tiktok filter game

answered Sep 22, 2023 at 15:47

5 votes

Why is Euler's Formula for Planar Graph Not Working Here?

answered Nov 29, 2019 at 9:54

5 votes

The number of Hamiltonian cycles in the complete bipartite graph

answered Feb 6, 2019 at 12:58

4 votes

Accepted

$\pi$ as the base of a numeral system?

answered Feb 7, 2019 at 10:38

4 votes

Accepted

Inductively defined sequence of graph neighborhoods

answered Feb 6, 2019 at 9:16

4 votes

Accepted

Prove there is such a triple

answered Jun 4, 2020 at 4:38

4 votes

Accepted

Show that if $G$ is $2-$connected, then for any two vertices $u$ and $v$ there exists a cycle $C$ such that $u, v \in V (C)$

answered May 19, 2020 at 23:53

4 votes

Accepted

if $n>0$ and $r>0$ ($n$ and $r$ and positive integers) and $r$ divides $n$ , then $n/r$ divides $nCr$ . Is this statement true?

answered Oct 30, 2020 at 0:41

3 votes

Accepted

Proof verification: linear span is the smallest subspace containing vectors

answered Jul 14, 2021 at 22:23

3 votes

Accepted

A corollary of Van der Waerden's theorem.

answered Sep 7, 2022 at 5:24

3 votes

Accepted

Every 4-regular connected simple graph edges can be colored with 2 colors so each vertex has 2 edges of each color, why my prove isn't working?

answered Jun 22, 2023 at 22:44

3 votes

Accepted

Are the graphs $C_{2n}^{n-1}$ strongly regular?

answered Jul 24, 2020 at 0:20

3 votes

Is there a graph operation that describes the following phenomenon?

answered Jul 31, 2020 at 1:17

3 votes

Accepted

An inequality in Erdős–Rényi random graph model

answered Oct 19, 2020 at 22:08

3 votes

Accepted

Planar graphs and homomorphism graphs?

answered May 19, 2020 at 23:39

3 votes

Accepted

Graph theory analysis

answered May 19, 2020 at 4:54

3 votes

Another approach on the four color theroem

answered Jun 18, 2020 at 4:11

3 votes

Can the domain of $f(x)/g(x)$ be larger than that of $f(x)$ or $g(x)$?

answered Feb 25, 2019 at 21:55

3 votes

Draw a simple graph where its vertices can be divided into 2 sets where every edge joins a vertex in one set to a vertex in the other

answered Jan 13, 2019 at 16:21

3 votes

Accepted

Chromatic polynomial properties

answered Jan 17, 2019 at 12:27

3 votes

Accepted

How to know that given a simple graph $G$ that a vertex $v$ if connected, then $G - v$ is also connected.

answered Jan 17, 2019 at 13:29

3 votes

Accepted

Let r be a rank function of a matroid M. Prove $ (r^)^=r$

answered Mar 20, 2019 at 16:16

3 votes

Accepted

confused about generalized ramsey numbers

answered Apr 5, 2019 at 11:03

3 votes

Accepted

How to show that this graph is planar?-Formal Proof

answered Sep 26, 2019 at 7:47

3 votes

Accepted

How should I notate a set of probability distributions?

answered Oct 10, 2019 at 10:23

3 votes

Accepted

Graph union and chromatic number

answered Oct 23, 2019 at 9:42

3 votes

Accepted

Proof or Counterexample: A ($K_3$,$C_5$)-free graph has fractional chromatic number at most 7/3.

answered Sep 14, 2023 at 15:02

2 votes

What's the smallest cycle that a graph with $n$ vertices and $m$ edges must have?

answered Jul 13, 2021 at 2:26

Stack Exchange Network

161 Answers

Why the "self-referential number" function eventually fixes every point

Which one of these is an abelian group?

What is the math behind the zombie tiktok filter game

Why is Euler's Formula for Planar Graph Not Working Here?

The number of Hamiltonian cycles in the complete bipartite graph

$\pi$ as the base of a numeral system?

Inductively defined sequence of graph neighborhoods

Prove there is such a triple

Show that if $G$ is $2-$connected, then for any two vertices $u$ and $v$ there exists a cycle $C$ such that $u, v \in V (C)$

if $n>0$ and $r>0$ ($n$ and $r$ and positive integers) and $r$ divides $n$ , then $n/r$ divides $nCr$ . Is this statement true?

Proof verification: linear span is the smallest subspace containing vectors

A corollary of Van der Waerden's theorem.

Every 4-regular connected simple graph edges can be colored with 2 colors so each vertex has 2 edges of each color, why my prove isn't working?

Are the graphs $C_{2n}^{n-1}$ strongly regular?

Is there a graph operation that describes the following phenomenon?

An inequality in Erdős–Rényi random graph model

Planar graphs and homomorphism graphs?

Graph theory analysis

Another approach on the four color theroem

Can the domain of $f(x)/g(x)$ be larger than that of $f(x)$ or $g(x)$?

Draw a simple graph where its vertices can be divided into 2 sets where every edge joins a vertex in one set to a vertex in the other

Chromatic polynomial properties

How to know that given a simple graph $G$ that a vertex $v$ if connected, then $G - v$ is also connected.

Let r be a rank function of a matroid M. Prove $ (r^)^=r$

confused about generalized ramsey numbers

How to show that this graph is planar?-Formal Proof

How should I notate a set of probability distributions?

Graph union and chromatic number

Proof or Counterexample: A ($K_3$,$C_5$)-free graph has fractional chromatic number at most 7/3.

What's the smallest cycle that a graph with $n$ vertices and $m$ edges must have?