A. Clay

activity

20242026

most citedApproximate normalizations for approximate density functionals

2 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Removable trees and matchings in $k$ -connected and $k$ -edge-connected graphs

Adam D. W. Clay, Tibor Jordán

T. Hasunuma (J. Graph Theory, 2023) conjectured that if $G$ is a $k$ -connected (resp. $k$ -edge-connected) graph with minimum degree $δ (G) \geq k + m - 1$ , and $T$ is a tree of order…

math.GT2026

A combinatorial approach to obstructing left-orderability of Dehn fillings

Adam Clay, Junyu Lu, Tjay Staruch

We introduce the conjugate-slope property of knots, a variant of Nie's Property (D), which can be used to study non-left-orderability of fundamental groups arising from Dehn fillin…

Removable trees and matchings in k-connected and k-edge-connected graphs

A combinatorial approach to obstructing left-orderability of Dehn fillings

Removable trees and matchings in $k$ -connected and $k$ -edge-connected graphs