User Tony Huynh

5 votes

Accepted

Exchanges between independent sets of a matroid

answered Oct 22, 2020 at 13:37

5 votes

Tree-width of graphs in which any two cycles touch

answered Oct 24, 2020 at 23:53

5 votes

Accepted

Number of 5x5 matrix permutations without repetitions in rows or columns

answered Oct 16, 2020 at 16:38

5 votes

Accepted

When do the circuits of a matroid have a connected intersection graph?

answered Oct 16, 2020 at 17:39

5 votes

Accepted

Density of bipartite $d$-degenerate graph

answered Feb 24, 2020 at 15:37

5 votes

Accepted

Is sum-balanceability computable?

answered Aug 2, 2019 at 8:06

5 votes

Accepted

Clutters with no maximum-size matchings

answered Nov 13, 2019 at 14:50

5 votes

Accepted

Independent sets of subsets

answered Oct 28, 2017 at 10:21

5 votes

Accepted

Has nontrivial solution in positive integers of a diophantine equation: $x_1^2+x_2^2+x_3^2+x_4^2=y_1^2+y_2^2+y_3^2+y_4^2$

answered Jul 5, 2017 at 13:41

5 votes

Accepted

"Strongly" almost disjoint subsets

answered Nov 28, 2016 at 14:03

5 votes

Characterizing graphs whose incidence matrix has the all ones vector in its row span

answered May 11, 2016 at 11:43

4 votes

Accepted

Size of forbidden minors for treewidth

answered Sep 6, 2016 at 12:03

4 votes

Accepted

Vertex deletion in knotless and linkless graphs

answered Oct 25, 2016 at 15:21

4 votes

Accepted

Modifying tree Graphs

answered Nov 26, 2016 at 4:01

4 votes

Number of subsets that sum to $0$

answered Jun 3, 2016 at 18:46

4 votes

Accepted

Relation between diametral path and regularity of a graph

answered May 21, 2016 at 9:37

4 votes

MSO2-expressible graph properties unexpressible in MSO1

answered Dec 22, 2016 at 10:40

4 votes

Accepted

2-approximation algorithm for Minimum Maximal Matching (MMM) problem

answered Jan 11, 2017 at 1:30

4 votes

Connected subgraphs and their sums

answered Oct 22, 2019 at 22:18

4 votes

Accepted

Cocktail party and tripartite graphs are DS?

answered Feb 14, 2020 at 6:08

4 votes

Accepted

The effects of collapsing vs joining non-adjacent vertices on the chromatic number

answered May 19, 2020 at 8:17

4 votes

Expanding Hall's theorem

answered Apr 26, 2020 at 4:33

4 votes

Polynomial time algorithm for rigid graph isomorphism

answered Jul 21, 2021 at 2:22

4 votes

Accepted

Hamiltonian cycle in $S_n$ with transpositions

answered Jun 25, 2021 at 8:34

4 votes

PhD dissertations that solve an established open problem

answered Sep 3, 2022 at 22:50

4 votes

Accepted

$k$-regular linear set systems

answered Aug 16, 2022 at 20:46

4 votes

Chromatic number and vertex connectivity

answered Jan 13, 2022 at 2:34

4 votes

Accepted

Efficient algorithm for edge-coloring complete graphs

answered Mar 12, 2022 at 4:41

4 votes

Accepted

Product of vertex degrees of an edge in a planar graph

answered Oct 26, 2021 at 6:42

4 votes

Partitioning a set of lattice points in the plane into rectangles

answered Aug 20, 2021 at 2:53

Stack Exchange Network

475 Answers

Exchanges between independent sets of a matroid

Tree-width of graphs in which any two cycles touch

Number of 5x5 matrix permutations without repetitions in rows or columns

When do the circuits of a matroid have a connected intersection graph?

Density of bipartite $d$-degenerate graph

Is sum-balanceability computable?

Clutters with no maximum-size matchings

Independent sets of subsets

Has nontrivial solution in positive integers of a diophantine equation: $x_1^2+x_2^2+x_3^2+x_4^2=y_1^2+y_2^2+y_3^2+y_4^2$

"Strongly" almost disjoint subsets

Characterizing graphs whose incidence matrix has the all ones vector in its row span

Size of forbidden minors for treewidth

Vertex deletion in knotless and linkless graphs

Modifying tree Graphs

Number of subsets that sum to $0$

Relation between diametral path and regularity of a graph

MSO2-expressible graph properties unexpressible in MSO1

2-approximation algorithm for Minimum Maximal Matching (MMM) problem

Connected subgraphs and their sums

Cocktail party and tripartite graphs are DS?

The effects of collapsing vs joining non-adjacent vertices on the chromatic number

Expanding Hall's theorem

Polynomial time algorithm for rigid graph isomorphism

Hamiltonian cycle in $S_n$ with transpositions

PhD dissertations that solve an established open problem

$k$-regular linear set systems

Chromatic number and vertex connectivity

Efficient algorithm for edge-coloring complete graphs

Product of vertex degrees of an edge in a planar graph

Partitioning a set of lattice points in the plane into rectangles