User Tony Huynh

3 votes

Is the max of two supermodular functions supermodular?

answered Jul 21, 2010 at 12:22

3 votes

Minimum spanning tree of a weighted graph

answered Jun 19, 2010 at 17:08

3 votes

Accepted

Contracting a planar graph to a (multiply-edged)-tree

answered Aug 15, 2014 at 22:39

3 votes

Accepted

Existence of neighborhood inclusion for 4-chordal graphs

answered Sep 20, 2014 at 15:10

3 votes

Accepted

Equality-preserving embeddings of finite trees

answered Jun 27, 2014 at 20:04

3 votes

Accepted

Graph construction to double coloring & Hadwiger number

answered Apr 3, 2014 at 14:06

3 votes

How to efficiently find a Hamiltonian cycle in a graph whose closure is complete?

answered May 1, 2014 at 13:11

3 votes

Is there a graph-theoretical proof of Tutte's theorem on matroids?

answered Oct 22, 2013 at 0:55

3 votes

Accepted

Does this graph contain at least two Hamiltonian cycles?

answered Oct 22, 2013 at 16:45

3 votes

Checking if a matroid is binary(Detecting $U^2_4$ minor in a matroid)

answered Nov 17, 2013 at 1:58

3 votes

Accepted

Do the cycles containing a fixed edge generate the cycle space of a graph?

answered Dec 1, 2013 at 23:03

3 votes

Bipartiteness criterion

answered Dec 23, 2012 at 19:20

3 votes

On cycles in self-centered graphs

answered Sep 13, 2013 at 15:07

3 votes

Meaning of a quote of Doubilet, Rota and Stanley on harmonic analysis and combinatorics

answered Nov 10, 2012 at 12:02

3 votes

Does every bipartite graph with 512 edges have an induced subgraph with 256 edges?

answered Nov 11, 2012 at 22:21

3 votes

A simplified Art Gallery Problem in a matrix

answered Apr 1, 2016 at 12:42

3 votes

Accepted

Choice number of embedded graphs

answered May 10, 2016 at 10:15

3 votes

Elementary linear algebra over a (possibly skew) field $K$

answered Feb 18, 2016 at 17:18

3 votes

Number of ways of tiling a $2 \times n$ rectangle using rectangles with integer sides

answered Feb 2, 2016 at 17:12

3 votes

Accepted

Asymptotics of list size in Robertson-Seymour theorem

answered Jan 13, 2016 at 21:39

3 votes

Eulerian graphs with prescribed number of edges

answered Nov 4, 2015 at 19:56

3 votes

Accepted

General ballot theorem

answered Apr 20, 2015 at 12:23

3 votes

Independence number of configuration graph (consisting of all (2k-1)!! ways to partition {1,2,...,2k} into k pairs)

answered Apr 17 at 4:41

3 votes

Accepted

Bounds on lengths of intervals in bounded-degree interval graphs

answered Jul 3 at 22:07

3 votes

Accepted

Extremal graph theory - many copies of $K_r$ imply a copy of $r$-chromatic $H$

answered Jun 14, 2023 at 17:44

3 votes

Escaping from infinitely many pursuers

answered Oct 2, 2021 at 11:18

3 votes

Accepted

Deleting triangles in a graph

answered Sep 15, 2021 at 23:49

3 votes

Accepted

Optimal number of half-spaces in the $H$-representation of the convex hull of $n$ points in $\mathbb R^d$

answered Dec 27, 2021 at 8:56

3 votes

Accepted

What's the name of the graph operation of connecting two copies of a graph with a perfect matching?

answered Oct 21, 2021 at 11:08

3 votes

Accepted

The lower bound of number of vertices covered by maximum matching in $3$-regular graph

answered Oct 12, 2021 at 3:53

Stack Exchange Network

475 Answers

Is the max of two supermodular functions supermodular?

Minimum spanning tree of a weighted graph

Contracting a planar graph to a (multiply-edged)-tree

Existence of neighborhood inclusion for 4-chordal graphs

Equality-preserving embeddings of finite trees

Graph construction to double coloring & Hadwiger number

How to efficiently find a Hamiltonian cycle in a graph whose closure is complete?

Is there a graph-theoretical proof of Tutte's theorem on matroids?

Does this graph contain at least two Hamiltonian cycles?

Checking if a matroid is binary(Detecting $U^2_4$ minor in a matroid)

Do the cycles containing a fixed edge generate the cycle space of a graph?

Bipartiteness criterion

On cycles in self-centered graphs

Meaning of a quote of Doubilet, Rota and Stanley on harmonic analysis and combinatorics

Does every bipartite graph with 512 edges have an induced subgraph with 256 edges?

A simplified Art Gallery Problem in a matrix

Choice number of embedded graphs

Elementary linear algebra over a (possibly skew) field $K$

Number of ways of tiling a $2 \times n$ rectangle using rectangles with integer sides

Asymptotics of list size in Robertson-Seymour theorem

Eulerian graphs with prescribed number of edges

General ballot theorem

Independence number of configuration graph (consisting of all (2k-1)!! ways to partition {1,2,...,2k} into k pairs)

Bounds on lengths of intervals in bounded-degree interval graphs

Extremal graph theory - many copies of $K_r$ imply a copy of $r$-chromatic $H$

Escaping from infinitely many pursuers

Deleting triangles in a graph

Optimal number of half-spaces in the $H$-representation of the convex hull of $n$ points in $\mathbb R^d$

What's the name of the graph operation of connecting two copies of a graph with a perfect matching?

The lower bound of number of vertices covered by maximum matching in $3$-regular graph