1 citations · 1 across the 9 of their papers we have counts for
6 papers · 1 filter
Counting almost independent sets in regular graphs
Gaia Carenini
Kahn proved that, among bipartite -regular graphs on vertices, the number of independent sets is maximized by a disjoint union of copies of . Zhao later extended th…
Blocky Matrices and Group Idempotents
Gaia Carenini
We prove a common generalization of two structure theorems: the dimension-free decomposition theorem for idempotent Schur multipliers and the idempotent theorem in harmonic analysi…
A quantitative container characterization of one-sided testability
Gaia Carenini, Cameron Seth, Yuichi Yoshida
We give a quantitative combinatorial characterization of size-oblivious one-sided testability in the dense graph model, resolving a question of Alon, Fischer, Newman, and Shapira.…
Embedding Induced Bounded Degree Graphs
Gaia Carenini
We prove a sparse embedding theorem for induced embeddings of bounded-degree graphs. The theorem applies to pairs : the graph supplies the positive edges of the t…
A unified abstract regularity lemma
Gaia Carenini, Leonardo Franchi
The goal of this short note is to prove a unified abstract regularity lemma which recovers Szemerédi's graph regularity lemma, Green's arithmetic regularity lemma, and a regularity…
A Sparse Transference Principle for a Non-Monotone Ramsey Property
Gaia Carenini
We prove a sparse transference theorem for induced Ramsey graphs. The theorem transfers the weighted random-host proof of Aragão, Campos, Dahia, Filipe, and Marciano to the sparse…