most citedOn the 2-adic complexity of a class of binary sequences of period with optimal autocorrelation magnitude

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

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2026

Spanning tight components in 4-uniform hypergraphs

Francesco Di Braccio, Brian Hearn, Joanna Lada +2

We prove that every -vertex 4-uniform hypergraph with minimum codegree at least has a spanning tight component. This is tight, and it settles the 4-uniform…