Zsolt Tuza is a Hungarian graph theorist and research professor emeritus in the graph theory department of the Alfréd Rényi Institute of Mathematics in Budapest. The Institute's page lists him as a Doctor of Science of the Hungarian Academy, records that he received the Officer's Cross of the Order of Merit of the Hungarian Republic in 2020, and names his research grants on combinatorial problems with a focus on games and on Turán numbers and extremal problems for paths. In 1981 he formulated the conjecture that bears his name, which says that the smallest number of edges whose removal destroys every triangle of a graph is at most twice the largest number of edge-disjoint triangles it contains.
Zsolt Tuza
Filter Results1 entry
Connections
Conjectures Posed
Source Tuza's Conjecture (Wikipedia)
In Branch
Source Zsolt Tuza (Rényi Institute profile)
Sources
Zsolt Tuza (Rényi Institute profile)
In Branch: Graph Theory, ProfileQuote, In Branch: Graph Theory, Profile
Research department: Graph theory
View the Source Tuza's Conjecture (Wikipedia)
Wikimedia FoundationConjectures Posed: Tuza's Conjecture, History and partial resultsQuote, Conjectures Posed: Tuza's Conjecture, History and partial results
Zsolt Tuza formulated Tuza's conjecture in 1981
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.