User user36212

30 votes

Accepted

Arriving at the same result with the opposite hypotheses

answered Jun 3, 2019 at 15:50

26 votes

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

answered Nov 13, 2018 at 13:31

12 votes

Packing rectangles: Does rotation ever help?

answered Apr 27, 2019 at 20:51

10 votes

Accepted

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

answered Jun 30, 2016 at 18:45

8 votes

Accepted

Counting labeled triangle-free graphs on $n$ vertices

answered Feb 2, 2018 at 15:52

7 votes

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

answered Oct 3, 2018 at 9:09

6 votes

Equal signs with fancy marks

answered Mar 3, 2017 at 11:56

6 votes

Embedding a hypercube into the Erdos-Renyi random graph

answered Jun 30, 2013 at 9:05

6 votes

What are the usual deadlines in paper submission procedure?

answered Oct 13, 2015 at 13:40

5 votes

Accepted

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

answered Sep 28, 2019 at 19:31

4 votes

Box stacking problem

answered Apr 27, 2019 at 21:05

4 votes

Zykov algorithm

answered Jun 18, 2019 at 18:48

4 votes

Baker, Gill, Solovay - Relativization

answered Sep 3, 2019 at 15:15

4 votes

Why do we need random variables?

answered Sep 23, 2016 at 9:07

4 votes

Almost graceful tree conjecture

answered Nov 2, 2018 at 11:36

3 votes

Accepted

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

answered Jun 10, 2017 at 22:18

3 votes

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

answered Mar 4, 2020 at 19:40

3 votes

Number of automorphisms of graphs of bounded valences

answered Mar 10, 2020 at 17:46

3 votes

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

answered Jun 3, 2020 at 19:41

2 votes

Accepted

Real number which is different from all rationals

answered Feb 2, 2020 at 9:37

2 votes

Satisfier-Falsifier games

answered Nov 23, 2018 at 10:29

2 votes

Clique Size in "Triangle Regular" Graphs

answered Nov 30, 2018 at 11:04

2 votes

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

answered Oct 12, 2016 at 22:06

2 votes

How many edges guarantee an expander?

answered Apr 16, 2015 at 14:43

2 votes

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

answered Aug 5, 2016 at 18:59

2 votes

Asymptotic behavior of a ratio of sums of iid random variables

answered Dec 7, 2015 at 11:12

2 votes

Bellman-Ford for Matching Problems?

answered Dec 15, 2015 at 11:31

1 vote

A small unavoidable collection of subgraphs

answered Sep 8, 2015 at 10:54

1 vote

Bounding chromatic number by a function of independence and clique number

answered Feb 23, 2017 at 22:59

1 vote

Accepted

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

answered Mar 8, 2017 at 8:29

Stack Exchange Network

38 Answers

Arriving at the same result with the opposite hypotheses

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

Packing rectangles: Does rotation ever help?

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

Counting labeled triangle-free graphs on $n$ vertices

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

Equal signs with fancy marks

Embedding a hypercube into the Erdos-Renyi random graph

What are the usual deadlines in paper submission procedure?

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

Box stacking problem

Zykov algorithm

Baker, Gill, Solovay - Relativization

Why do we need random variables?

Almost graceful tree conjecture

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

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

Number of automorphisms of graphs of bounded valences

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

Real number which is different from all rationals

Satisfier-Falsifier games

Clique Size in "Triangle Regular" Graphs

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

How many edges guarantee an expander?

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

Asymptotic behavior of a ratio of sums of iid random variables

Bellman-Ford for Matching Problems?

A small unavoidable collection of subgraphs

Bounding chromatic number by a function of independence and clique number

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