Gyula Y. Katona

Q: What Schools Are Affiliated With Gyula Y. Katona

Gyula Y. Katona is affiliated with the following schools: Eötvös Loránd University, Budapest University of Technology and Economics, Arizona State University

Gyula Y. Katona's AcademicInfluence.com Rankings

Gyula Y. Katona

Mathematics

#2970

World Rank

#4472

Historical Rank

Graph Theory

#60

World Rank

#67

Historical Rank

Combinatorics

#68

World Rank

#75

Historical Rank

Measure Theory

#5495

World Rank

#6521

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Gyula Y. Katona's Degrees

PhD Mathematics Eötvös Loránd University

Why Is Gyula Y. Katona Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gyula Y. Katona is a Hungarian mathematician, the son of mathematician Gyula O. H. Katona. He received his Ph.D. in 1997 from Hungarian Academy of Sciences, with a dissertation titled Paths and Cycles in Graphs and Hypergraphs under the advisement of László Lovász and András Recski, and is on the faculty of the Budapest University of Technology and Economics.

(See a Problem?)

Gyula Y. Katona's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Hamiltonian chains in hypergraphs (1999) (152)
Hypergraph extensions of the Erdős-Gallai Theorem (2010) (73)
SIS Epidemic Propagation on Hypergraphs (2015) (61)
Packing paths of length at least two (2004) (47)
Extensions of the Erd¨os-Ko-Rado theorem (1976) (25)
Extremal k-edge-hamiltonian Hypergraphs (2008) (24)
Chordality and 2-factors in Tough Graphs (2000) (18)
Most Probably Intersecting Families of Subsets (2012) (18)
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs (2010) (16)
Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods (2009) (16)
Toughness and edge-toughness (1997) (15)
The optimal rubbling number of ladders, prisms and Möbius-ladders (2014) (15)
Odd subgraphs and matchings (2002) (15)
Hamiltonian path saturated graphs with small size (2006) (11)
Structure theorem and algorithm on (1, f)-odd subgraph (2007) (10)
Decomposition of a Graph into Two Disjoint Odd Subgraphs (2018) (9)
Extremal P4-stable graphs (2011) (9)
Constructions for the optimal pebbling of grids (2016) (9)
Bounds on the number of edges in hypertrees (2014) (8)
Properties of minimally t-tough graphs (2016) (7)
Elementary Graphs with Respect to f-Parity Factors (2009) (7)
Properties of Edge-Tough Graphs (1999) (6)
The optimal pebbling number of staircase graphs (2016) (6)
Optimal Pebbling Number of the Square Grid (2018) (5)
Advances in discrete mathematics and applications : Mysore, 2008 : proceedings of the International Conference on Discrete Mathematics (ICDM 2008), held at University of Mysore, Mysore (6-10 June, 2008) (2010) (5)
BME VIK Annual Research Report on Electrical Engineering and Computer Science 2016 (2017) (4)
Minimally toughness in special graph classes (2018) (4)
Extensions to the Erdős-Ko-Rado Theorem (1975) (4)
Optimal pebbling of grids (2015) (4)
Extremal Stable Graphs. (2009) (4)
BME VIK Annual Research Report on Electrical Engineering and Computer Science 2015 (2016) (4)
Hamilton-chain saturated hypergraphs (2010) (3)
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes (2014) (3)
Optimal pebbling and rubbling of graphs with given diameter (2017) (3)
m_Path Cover Saturated Graphs (2003) (3)
Optimal pebbling number of graphs with given minimum degree (2018) (3)
Strengthening some complexity results on toughness of graphs (2019) (2)
Extremal P 4-stable Graphs (2010) (2)
Edge Disjoint Polyp Packing (1997) (2)
The complexity of recognizing minimally tough graphs (2017) (2)
Extension of paths and cycles for hypergraphs (2014) (1)
Local Topological Toughness and Local Factors (2007) (1)
A Lower Bound for Graph Energy of Fullerenes (2016) (1)
Properties of minimally tough graphs (2021) (1)
Diszkrét és konvex geometria = Discrete and convex geometry (2008) (0)
Diszkrét matematika = Discrete mathematics (2009) (0)
Diszkrét matematika és alkalmazásai = Discrete mathematics and its applications (2007) (0)
SIS Epidemic Propagation on Hypergraphs (2016) (0)
Optimal Pebbling Number of the Square Grid (2020) (0)
Upper Bound on the Optimal Rubbling Number in graphs with given minimum degree (2015) (0)
Conditions for minimally tough graphs (2022) (0)
2 1 Se p 20 15 SIS epidemic propagation on hypergraphs (2015) (0)
Minimally tough chordal graphs with toughness at most 1/2 (2022) (0)
Gráfok és algoritmusok = Graphs and algorithms (2008) (0)
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs (2012) (0)
Note searching forf-hamiltonian circuits (1992) (0)
Elementary graphs with respect to (1, f)-odd factors (2008) (0)
Decomposition of a Graph into Two Disjoint Odd Subgraphs (2018) (0)
A large set of non-Hamiltonian graphs (2001) (0)

This paper list is powered by the following services:

Other Resources About Gyula Y. Katona

en.wikipedia.org

What Schools Are Affiliated With Gyula Y. Katona?

Gyula Y. Katona is affiliated with the following schools:

Gyula Y. Katona's Academic­Influence.com Rankings

Gyula Y. Katona's Degrees

Why Is Gyula Y. Katona Influential?

Gyula Y. Katona's Published Works

Published Works

Other Resources About Gyula Y. Katona

What Schools Are Affiliated With Gyula Y. Katona?

Gyula Y. Katona's AcademicInfluence.com Rankings