A. Clay

activity

20242026

most citedApproximate normalizations for approximate density functionals

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

collaborators

Showing math.COShow 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, 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.CO2024

Minimally rigid tensegrity frameworks

Adam D. W. Clay, Tibor JordÃ¡n, SÃ¡ra Hanna TÃ³th

A $d$ -dimensional tensegrity framework $(T, p)$ is an edge-labeled geometric graph in $R^{d}$ , which consists of a graph $T = (V, B \cup C \cup S)$ and a map $p:V\to {\mathbb R}^…

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

Minimally rigid tensegrity frameworks

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