User Louis D

16 votes

Lunch seminars for PhD students

answered Oct 15, 2021 at 13:19

14 votes

Accepted

In an Erdős–Rényi random graph, what is the threshold for the property "every edge is contained in at least one triangle"?

answered Aug 3, 2016 at 22:17

14 votes

Books that teach other subjects, written for a mathematician

answered Nov 20, 2020 at 12:32

8 votes

Noteworthy, but not so famous conjectures resolved recent years

answered Nov 24, 2020 at 2:26

8 votes

Longest increasing subsequence as measure of randomness

answered Apr 13, 2022 at 18:51

5 votes

What are efficient pooling designs for RT-PCR tests?

answered Nov 19, 2020 at 3:12

5 votes

For which Ramsey type results density versions are wrong?

answered Aug 12, 2020 at 20:31

4 votes

Accepted

Infinitely many counterexamples to Nash-Williams's conjecture about hamiltonicity?

answered Aug 15, 2020 at 22:54

4 votes

A counterexample to a conjecture of Nash-Williams about hamiltonicity of digraphs?

answered Aug 12, 2020 at 17:29

4 votes

Accepted

Is König's Property for graphs inheritable from finite subgraphs?

answered May 26, 2022 at 23:44

4 votes

Accepted

Cardinalities of maximal linear $k$-subsets of $n = \{0,\ldots,n-1\}$

answered Nov 2, 2021 at 20:10

3 votes

Induced subgraphs of the almost-disjointness graph

answered May 14, 2021 at 15:29

2 votes

Accepted

Injective choice function for infinite complete linear hypergraphs

answered Nov 6, 2020 at 23:12

2 votes

Giving a math talk with no blackboard or projector

answered Sep 16, 2011 at 14:41

2 votes

Perfect matchings of a regular, uniform, partite hypergraph

answered Aug 11, 2020 at 20:09

2 votes

Common/well-known results with natural and/or useful reformulations

answered Sep 9, 2022 at 16:15

2 votes

Does a strong digraph always admit a vertex that lies on some path between $\Theta(n^2)$ pairs of vertices?

answered Mar 9, 2023 at 18:34

1 vote

Relationship between minimum vertex cover and matching width

answered Oct 8, 2020 at 15:47

1 vote

Graph $G$ such that removing an edge leaves $G$ "unchanged"

answered Jul 28, 2021 at 1:52

1 vote

Proving that every strongly connected tournament T on at least 4 vertices contains distinct vertices u, v such that T-u and T-v are strongly connected

answered Dec 7, 2020 at 16:51

1 vote

Directed version of this lemma

answered Apr 2, 2021 at 17:38

1 vote

Pairs of vertices with high degree difference

answered Apr 12, 2021 at 17:55

0 votes

Accepted

Does every primitive digraph have a directed cycle?

answered Aug 19, 2020 at 17:03

0 votes

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

answered Aug 5, 2016 at 2:05

Stack Exchange Network

24 Answers

Lunch seminars for PhD students

In an Erdős–Rényi random graph, what is the threshold for the property "every edge is contained in at least one triangle"?

Books that teach other subjects, written for a mathematician

Noteworthy, but not so famous conjectures resolved recent years

Longest increasing subsequence as measure of randomness

What are efficient pooling designs for RT-PCR tests?

For which Ramsey type results density versions are wrong?

Infinitely many counterexamples to Nash-Williams's conjecture about hamiltonicity?

A counterexample to a conjecture of Nash-Williams about hamiltonicity of digraphs?

Is König's Property for graphs inheritable from finite subgraphs?

Cardinalities of maximal linear $k$-subsets of $n = \{0,\ldots,n-1\}$

Induced subgraphs of the almost-disjointness graph

Injective choice function for infinite complete linear hypergraphs

Giving a math talk with no blackboard or projector

Perfect matchings of a regular, uniform, partite hypergraph

Common/well-known results with natural and/or useful reformulations

Does a strong digraph always admit a vertex that lies on some path between $\Theta(n^2)$ pairs of vertices?

Relationship between minimum vertex cover and matching width

Graph $G$ such that removing an edge leaves $G$ "unchanged"

Proving that every strongly connected tournament T on at least 4 vertices contains distinct vertices u, v such that T-u and T-v are strongly connected

Directed version of this lemma

Pairs of vertices with high degree difference

Does every primitive digraph have a directed cycle?

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