4 papers
math.CO2026
Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs
Nikolai Terekhov
Given an -uniform hypergraph and a positive integer , the weak saturation number is the minimum number of edges in an -uniform hypergraph on $…
math.CO2026
A short proof of Tuza's conjecture for weak saturation in hypergraphs
Nikolai Terekhov
Given an -uniform hypergraph and a positive integer , the weak saturation number is the minimum number of edges in an -uniform hypergraph on $…
math.CO2026
Weak saturation of tensor product of cliques
Nikolai Terekhov
Given two hypergraphs and , the weak saturation number is the minimum number of edges in a spanning subhypergraph of such that th…
math.CO2026
Forbidding just one intersection for short integer sequences
Elizaveta Iarovikova, Fedor Noskov, Georgy Sokolov +1
In this paper, we study the famous ErdÅs--Sós forbidden intersection problem for words over an alphabet of size : what is the maximal size of a subfamily of $[m]…