Jørgen Bang-Jensen

Sharp connectivity thresholds for mixed rigidity packings and improved bounds for highly connected orientations of graphs

Garamv\"olgyi, Jord\'an, Kir\'aly and Vill\'anyi [{{\bf Forum Math. Pi} \textbf{13} (2025), Paper No.~e11}] posed two sharp connectivity conjectures for packing rigid spanning subgraphs: one for the equal-dimensional case and the other for the packing of a $d$-rigid spanning subgraph with a spanning tree. We prove a un...