User user36212

1 vote

Accepted

Making graphs isomorphic with edge additions/removals

answered Nov 1, 2020 at 23:27

3 votes

Are complete regular linear hypergraphs on $\omega$ isomorphic?

answered Jun 3, 2020 at 19:41

1 vote

Explanation of a proof of an embedding lemma of Bollobas and Thomason

answered May 20, 2020 at 6:15

3 votes

Number of automorphisms of graphs of bounded valences

answered Mar 10, 2020 at 17:46

3 votes

Chernoff-type bounds for a stopped sum of independent random variables

answered Mar 4, 2020 at 19:40

1 vote

Accepted

Size of minimum cut in random graph

answered Feb 29, 2020 at 15:07

2 votes

Accepted

Real number which is different from all rationals

answered Feb 2, 2020 at 9:37

0 votes

Is any real function satisfying basic conditions a moment generating function?

answered Nov 30, 2019 at 10:03

5 votes

Accepted

Probability of a subset of Bernoulli's being all 1's

answered Sep 28, 2019 at 19:31

4 votes

Baker, Gill, Solovay - Relativization

answered Sep 3, 2019 at 15:15

4 votes

Zykov algorithm

answered Jun 18, 2019 at 18:48

0 votes

Upper-bound for maximal-cliques on perfect graphs

answered Jun 17, 2019 at 17:58

30 votes

Accepted

Arriving at the same result with the opposite hypotheses

answered Jun 3, 2019 at 15:50

4 votes

Box stacking problem

answered Apr 27, 2019 at 21:05

12 votes

Packing rectangles: Does rotation ever help?

answered Apr 27, 2019 at 20:51

2 votes

Clique Size in "Triangle Regular" Graphs

answered Nov 30, 2018 at 11:04

2 votes

Satisfier-Falsifier games

answered Nov 23, 2018 at 10:29

26 votes

Have there been any updates on Mochizuki's proposed proof of the abc conjecture?

answered Nov 13, 2018 at 13:31

4 votes

Almost graceful tree conjecture

answered Nov 2, 2018 at 11:36

7 votes

A Modern Proof of Erdos and Renyi's 1959 Random Graph Paper?

answered Oct 3, 2018 at 9:09

8 votes

Accepted

Counting labeled triangle-free graphs on $n$ vertices

answered Feb 2, 2018 at 15:52

3 votes

Accepted

Inequality about the minimum vertex degree in $k$-uniform hypergraphs

answered Jun 10, 2017 at 22:18

1 vote

Accepted

What is the minimum diameter of $r$-regular, $k$-connected graphs?

answered Mar 8, 2017 at 8:29

6 votes

Equal signs with fancy marks

answered Mar 3, 2017 at 11:56

1 vote

Bounding chromatic number by a function of independence and clique number

answered Feb 23, 2017 at 22:59

2 votes

Maximum number of edges in bipartite graph without cycles of length 4

answered Oct 12, 2016 at 22:06

4 votes

Why do we need random variables?

answered Sep 23, 2016 at 9:07

2 votes

Tight bound of Turan number for K_{1,t,t}

answered Aug 5, 2016 at 18:59

10 votes

Accepted

Question on a paper by Benjamini/Kozma/Wormald about a “well known fact”

answered Jun 30, 2016 at 18:45

2 votes

Bellman-Ford for Matching Problems?

answered Dec 15, 2015 at 11:31

Stack Exchange Network

38 Answers

Making graphs isomorphic with edge additions/removals

Are complete regular linear hypergraphs on $\omega$ isomorphic?

Explanation of a proof of an embedding lemma of Bollobas and Thomason

Number of automorphisms of graphs of bounded valences

Chernoff-type bounds for a stopped sum of independent random variables

Size of minimum cut in random graph

Real number which is different from all rationals

Is any real function satisfying basic conditions a moment generating function?

Probability of a subset of Bernoulli's being all 1's

Baker, Gill, Solovay - Relativization

Zykov algorithm

Upper-bound for maximal-cliques on perfect graphs

Arriving at the same result with the opposite hypotheses

Box stacking problem

Packing rectangles: Does rotation ever help?

Clique Size in "Triangle Regular" Graphs

Satisfier-Falsifier games

Have there been any updates on Mochizuki's proposed proof of the abc conjecture?

Almost graceful tree conjecture

A Modern Proof of Erdos and Renyi's 1959 Random Graph Paper?

Counting labeled triangle-free graphs on $n$ vertices

Inequality about the minimum vertex degree in $k$-uniform hypergraphs

What is the minimum diameter of $r$-regular, $k$-connected graphs?

Equal signs with fancy marks

Bounding chromatic number by a function of independence and clique number

Maximum number of edges in bipartite graph without cycles of length 4

Why do we need random variables?

Tight bound of Turan number for K_{1,t,t}

Question on a paper by Benjamini/Kozma/Wormald about a “well known fact”

Bellman-Ford for Matching Problems?