421 citations
- Babeș-Bolyai UniversityRO45 papers
- Oxford Brookes UniversityGB14 papers
- Ton Duc Thang UniversityVN11 papers
- University of RijekaHR11 papers
- J. Selye UniversitySK10 papers
- Budapest University of Technology and EconomicsHU9 papers
- HUN-REN Wigner Research Centre for PhysicsHU9 papers
- Sapientia Hungarian University of TransylvaniaRO9 papers
- Slovak University of Technology in BratislavaSK8 papers
- Ludovika University of Public ServiceHU7 papers
- Duy Tan UniversityVN6 papers
- Indian Institute of Technology MadrasIN5 papers
10 papers · 1 filter
Caps and Wickets
Jakob Führer, Jozsef Solymosi
Let be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, {\em wicket}, is formed by three rows and two columns of…
Improved Elekes-Szabó type estimates using proximity
Jozsef Solymosi, Joshua Zahl
We prove a new Elekes-Szabó type estimate on the size of the intersection of a Cartesian product with an algebraic surface over the reals. In particul…
An uniform version of Dvir and Moran's theorem
Gábor Hegedüs
Dvir and Moran proved the following upper bound for the size of a family $\mbox{$\cal F$}$ of subsets of with $\mbox{Vdim}(\mbox{$\cal F$} Δ\mbox{$\cal F$})\leq d$. Let $d\le…
About sunflowers
Gábor Hegedűs
Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for is sunflower-free if for ev…
On the transmission-based graph topological indices
Reza Sharafdini, Tamas Reti
The distance between the vertices and of a connected graph is defined as the number of edges in a minimal path connecting them. The \emph{transmission} of a ve…
Sunflowers and -intersecting families
Gábor Hegedűs
Let stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than element…