Hong Liu (刘鸿), Nested cycles with no geometric crossing
Room B232 IBS (기초과학연구원)In 1975, Erdős asked the following question: what is the smallest function
In 1975, Erdős asked the following question: what is the smallest function
The twin-width of a graph G can be defined as the least integer d such that there is a sequence of length |V(G)| of (strictly) coarser and coarser partitions of …
We show that that the maximum number of of edges in a
A pure pair in a graph G is a pair of subsets A, B of the vertex set of G such that in G, either all of the edges or …
In this talk we will have a brief introduction to oriented matroids and their relation to real-representability.
For a graph G and an integer d, the dth power of G is the graph
Ordered Ramsey numbers were introduced in 2014 by Conlon, Fox, Lee, and Sudakov. Their results included upper bounds for general graphs and lower bounds showing separation from classical Ramsey numbers. We …
A graph
Bouchet introduced isotropic systems in 1983 unifying some combinatorial features of binary matroids and 4-regular graphs. The concept of isotropic system is a useful tool to study vertex-minors of graphs …
Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that typically occur together. They can thereby discover, relate, and structure …