Tony Huynh, The Peaceable Queens Problem
Room B332 IBS (기초과학연구원)The peaceable queens problem asks to determine the maximum number
The peaceable queens problem asks to determine the maximum number
A replacement action is a function
The group
An induced packing of cycles in a graph is a set of vertex-disjoint cycles such that the graph has no edge between distinct cycles of the set. The classic Erdős-Pósa theorem …
A family
We present a full characterization of the unavoidable induced subgraphs of graphs with large pathwidth. This consists of two results. The first result says that for every forest H, every …
In 1996, Reed, Robertson, Seymour and Thomas proved Younger's Conjecture, which states that for all directed graphs D, there exists a function f such that if D does not contain …
Since the proof of the graph minor structure theorem by Robertson and Seymour in 2004, its underlying ideas have found applications in a much broader range of settings than their …
The dimension of a poset is the least integer
By utilizing the recently developed hypergraph analogue of Godsil's identity by the second author, we prove that for all