16 citations · 50 across the 58 of their papers we have counts for
7 papers · 2 filters
Some exact results for regular Turán problems
Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1
As a variant of the famous Turán problem, we study , the maximum number of edges that an -vertex regular graph can have without containing a copy of . We d…
Regular Turán numbers
Yair Caro, Zsolt Tuza
The regular Turán number of a graph , denoted by rex, is the largest number of edges in a regular graph of order such that does not contain subgraphs isomorph…
The domination number of the graph defined by two levels of the -cube, II
József Balogh, Gyula O. H. Katona, William Linz +1
Consider all -element subsets and -element subsets of an -element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding $\ell…
Singular Turán numbers and WORM-colorings
Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1
A subgraph of is \textit{singular} if the vertices of either have the same degree in or have pairwise distinct degrees in . The largest number of edges of a grap…
On specific factors in graphs
Csilla Bujtás, Stanislav Jendrol, Zsolt Tuza
It is well known that if } is a multigraph and is a subset of even order, then contains a spanning forest such that each vertex from has an odd…
Singular Ramsey and Turán numbers
Yair Caro, Zsolt Tuza
We say that a subgraph of a graph is singular if the degrees are all equal or all distinct for the vertices . The singular Ramsey number Rs is the…
Realization of digraphs in Abelian groups and its consequences
Sylwia Cichacz, Zsolt Tuza
Let be a directed graph with no component of orderless than~, and let be a finite Abelian group such that or if $|V(\…