14.2k citations
- Seoul National UniversityKR254 papers
- California Institute of TechnologyUS181 papers
- Korea Institute of Science & Technology InformationKR179 papers
- University of FloridaUS179 papers
- Cardiff UniversityGB176 papers
- Max Planck Institute for Gravitational PhysicsDE176 papers
- University of Wisconsin–MilwaukeeUS176 papers
- Syracuse UniversityUS174 papers
- The University of MelbourneAU174 papers
- Inter-University Centre for Astronomy and AstrophysicsIN173 papers
- LIGO Scientific CollaborationUS173 papers
- Louisiana State UniversityUS173 papers
33 papers · 1 filter
Twin-width of random graphs
Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey +2
We investigate the twin-width of the Erdős-Rényi random graph . We unveil a surprising behavior of this parameter by showing the existence of a constant su…
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
J. Pascal Gollin, Kevin Hendrey, O-joung Kwon +2
In 1965, Erdős and Pósa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such…
A colorful Goodman-Pollack-Wenger theorem
Andreas F. Holmsen
Hadwiger's transversal theorem gives necessary and sufficient conditions for the existence of a line transversal to a family of pairwise disjoint convex sets in the plane. These co…
On a rainbow extremal problem for color-critical graphs
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +2
There has been extensive studies on the following question: given graphs over a common vertex set of size , what conditions on ensures a `colorful' co…
Independent domination of graphs with bounded maximum degree
Eun-Kyung Cho, Jinha Kim, Minki Kim +1
An independent dominating set of a graph, also known as a maximal independent set, is a set of pairwise non-adjacent vertices such that every vertex not in is adjacent to s…
Prime vertex-minors of a prime graph
Donggyu Kim, Sang-il Oum
A graph is prime if it does not admit a partition of its vertex set such that and the rank of the submatrix of its adjacency matrix is…