The following pages link to Tony Huynh (Q405130):
Displayed 48 items.
- Extremal problems for subset divisors (Q405131) (← links)
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- Explicit bounds for graph minors (Q723881) (← links)
- On Hilbert bases of cuts (Q898132) (← links)
- Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
- Space proof complexity for random 3-CNFs (Q2013560) (← links)
- Unavoidable minors for graphs with large \(\ell_p\)-dimension (Q2039320) (← links)
- Recognizing Cartesian products of matrices and polytopes (Q2056923) (← links)
- Notes on tree- and path-chromatic number (Q2058953) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Excluding a ladder (Q2095109) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- Correction to: ``Idealness of \(k\)-wise intersecting families'' (Q2118115) (← links)
- Extended formulations for stable set polytopes of graphs without two disjoint odd cycles (Q2118145) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- The biclique covering number of grids (Q2335697) (← links)
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor (Q2400967) (← links)
- Seymour's conjecture on 2-connected graphs of large pathwidth (Q2663412) (← links)
- Strongly Even-Cycle Decomposable Graphs (Q2958205) (← links)
- The Excluded Minors for Isometric Realizability in the Plane (Q2968517) (← links)
- Transfinite Ford–Fulkerson on a finite network (Q4628352) (← links)
- Intertwining Connectivities in Representable Matroids (Q4979834) (← links)
- Idealness of k-wise Intersecting Families (Q5041730) (← links)
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles (Q5041738) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- A tight Erdős-Pósa function for planar minors (Q5126748) (← links)
- The stable set problem in graphs with bounded genus and bounded odd cycle packing number (Q5146973) (← links)
- Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank (Q5219666) (← links)
- A tight Erdős-Pósa function for planar minors (Q5236274) (← links)
- Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number<sup>*</sup> (Q5360884) (← links)
- A Tight Erdös--Pósa Function for Wheel Minors (Q5374439) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- Flip distances between graph orientations (Q5919466) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Improved product structure for graphs on surfaces (Q6045446) (← links)
- Short rainbow cycles in graphs and matroids (Q6055390) (← links)
- A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams (Q6162034) (← links)
- Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem (Q6256182) (← links)
- Excluding a ladder (Q6333994) (← links)
- A simple 7/3-approximation algorithm for feedback vertex set in tournaments (Q6347411) (← links)
- A simple $(2+\epsilon)$-approximation algorithm for Split Vertex Deletion (Q6349698) (← links)
- Universality in minor-closed graph classes (Q6376556) (← links)
- Product structure of graph classes with bounded treewidth (Q6401220) (← links)
- Notes on Aharoni's rainbow cycle conjecture (Q6417284) (← links)