Gyula O. H. Katona | Academic Influence

Gyula O. H. Katona's AcademicInfluence.com Rankings

Gyula O. H. Katona

Mathematics

#857

World Rank

#1520

Historical Rank

Combinatorics

#20

World Rank

#24

Historical Rank

Graph Theory

#44

World Rank

#51

Historical Rank

Measure Theory

#2434

World Rank

#2913

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Gyula O. H. Katona's Degrees

PhD Mathematics Eötvös Loránd University

Why Is Gyula O. H. Katona Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gyula O. H. Katona is a Hungarian mathematician known for his work in combinatorial set theory, and especially for the Kruskal–Katona theorem and his beautiful and elegant proof of the Erdős–Ko–Rado theorem in which he discovered a new method, now called Katona's cycle method. Since then, this method has become a powerful tool in proving many interesting results in extremal set theory. He is affiliated with the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.

(See a Problem?)

Gyula O. H. 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

A theorem of finite sets (2009) (317)
A simple proof of the Erd?s-Chao Ko-Rado theorem (1972) (191)
Two applications (for search theory and truth functions) of Sperner type theorems (1973) (130)
Graphs with maximal number of adjacent pairs of edges (1978) (122)
Intersection theorems for systems of finite sets (1964) (119)
Extremal problems with excluded subgraphs in the n-cube (1983) (98)
Contributions to the geometry of hamming spaces (1977) (94)
Extremal Problems for Hypergraphs (1975) (83)
On separating systems of a finite set (1966) (81)
Huffman codes and self-information (1976) (74)
Largest family without A ∪ B ⊆ C ∩ D (2005) (66)
Largest Families Without an r-Fork (2007) (59)
Combinatorial Search Problems (1991) (59)
The Hamming-sphere has minimum boundary (1975) (51)
No four subsets forming an N (2008) (50)
Minimum matrix representation of closure operations (1985) (48)
Semantics in Databases (1998) (43)
The poset of closures as a model of changing databases (1987) (39)
A generalization of some generalizations of Sperner's theorem (1972) (38)
Extremal hypergraph problems and convex hulls (1985) (35)
On a problem of graph theory (1967) (35)
More Sets, Graphs and Numbers (2006) (34)
Intersecting sperner families and their convex hulls (1984) (32)
European Congress of Mathematics (1998) (31)
Design type problems motivated by database theory (1998) (31)
Extremal Combinatorial Problems in Relational Data Base (1981) (30)
Asymptotic Properties of Keys and Functional Dependencies in Random Databases (1998) (28)
Continuous versions of some extremal hypergraph problems. II (1980) (28)
The Characterization of Branching Dependencies (1992) (28)
Bounds on Maximal Families of Sets Not Containing Three Sets with A ∩ B ⊂ C, A ⊄ B (2008) (28)
Solution of a Problem of A. Ehrenfeucht and J. Mycielski (1974) (27)
Algebra, combinatorics, and logic in computer science (1986) (27)
Minimal 2-coverings of a finite affine space based on GF(2) (1983) (26)
On the Number of Databases and Closure Operations (1991) (24)
Entropy, search, complexity (2007) (22)
Convex hulls of more-part Sperner families (1986) (21)
Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) (2008) (19)
Fete of combinatorics and computer science (2010) (18)
Most Probably Intersecting Families of Subsets (2012) (18)
Some Contributions to the Minimum Representation Problem of Key Systems (2006) (17)
Families of subsets having no subset containing another one with small difference (1972) (17)
On the number of maximal dependencies in a data base relation of fixed order (1980) (15)
Constructions via Hamiltonian Theorems (2005) (14)
Theory of graphs : proceedings of the colloquium, held at Tihany, Hungary, September, 1966 (1968) (14)
On the Number of Independent Functional Dependencies (2006) (14)
On a problem of L. Fejes Tóth (1977) (13)
A survey of some combinatorial results concerning functional dependencies in database relations (1993) (13)
The Cycle Method and Its Limits (2000) (13)
Building bridges : between mathematics and computer science (2008) (12)
The Average Length of Keys and Functional Dependencies in (Random) Databases (1995) (12)
Extremal Combinatorial Problems of Database Models (1987) (12)
All maximum 2-part Sperner families (1986) (12)
Two-Part and k-Sperner Families: New Proofs Using Permutations (2005) (12)
A three part Sperner theorem (1973) (11)
Horizons of combinatorics (2008) (11)
Pairs of Disjoint q-element Subsets Far from Each Other (2001) (11)
A general 2-part Erdȍs-Ko-Rado theorem (2017) (11)
Combinatorial and Algebraic Results for Database Relations (1992) (11)
A NEW TYPE OF CODING PROBLEM (2001) (10)
Probabilistic Inequalities from Extremal Graph Results (A Survey) (1985) (10)
2-Bases of Quadruples (2006) (9)
Sums of Vectors and Turán's Problem for 3-graphs (1981) (9)
More sets, graphs and numbers : a salute to Vera Sós and András Hajnal (2006) (9)
“Best” estimations on the distribution of the length of sums of two random vectors (1982) (9)
Search With Small Sets in Presence of a Liar (2002) (9)
Codes that attain minimum distance in every possible direction (2008) (9)
Majority and Plurality Problems (2012) (9)
Combinatorial numbers, geometric constants and probabilistic inequalities (1980) (9)
Functional dependencies distorted by errors (2008) (9)
The domination number of the graph defined by two levels of the n-cube (2019) (8)
Low Discrepancy Allocation of Two-Dimensional Data (2000) (8)
New type of coding problem motivated by database theory (2004) (8)
Information sources with different cost scales and the principle of conservation of entropy (1969) (7)
Some remarks on the construction of optimal codes (1972) (7)
Polytopes Determined by Hypergraph Classes (1985) (7)
Incomparable Copies of a Poset in the Boolean Lattice (2013) (7)
A Simple Proof of a Theorem of Milner (1998) (7)
Error-Correcting Keys in Relational Databases (2000) (6)
Partial Dependencies in Relational Databases and their Realization (1992) (6)
Functional Dependencies in Presence of Errors (2002) (6)
Largest family without A union B subset of C intersection D (2004) (6)
If the intersection of any r sets has a size ̸= r − 1 (1979) (6)
Horizons of Combinatorics (Bolyai Society Mathematical Studies) (2008) (6)
Around the Complete Intersection Theorem (2016) (5)
The Turán number of the square of a path (2019) (5)
Union-Intersecting Set Systems (2014) (5)
Sperner type theorems with excluded subposets (2013) (5)
Greedy Construction of Nearly Regular Graphs (1993) (5)
On the security of individual data (2004) (5)
Linear Inequalities Describing the Class of Intersecting Sperner Families of Subsets, I (1990) (4)
Building Bridges: Between Mathematics and Computer Science (Bolyai Society Mathematical Studies) (2008) (4)
Turán's graph theorem, measures and probability theory (2014) (4)
A 3-part Sperner theorem (1987) (4)
Strong qualitative independence (2004) (4)
The number of triangles is more when they have no common vertex (2020) (4)
Sperner-type theorems (2018) (4)
Entropy, Search, Complexity (Bolyai Society Mathematical Studies) (2007) (4)
The principle of conservation of entropy in a noiseless channel (1967) (3)
A coding problem for pairs of subsets (2003) (3)
Extremal problems for finite sets and convex hulls - A survey (1997) (3)
Encoding Databases Satisfying a Given Set of Dependencies (2012) (3)
Foundations of Information and Knowledge Systems (2012) (3)
Random Databases with Correlated Data (2012) (3)
Optimization of the reliability polynomial in presence of mediocre elements (1993) (3)
Inequalities for the distribution of the length of random vector sums (1978) (3)
General theory of noiseless channels (1970) (3)
Semantics in databases : Second International Workshop, Dagstuhl Castle, Germany, January 7-12, 2001 : revised papers (2003) (3)
Finding at least one excellent element in two rounds (2011) (3)
The domination number of the graph deﬁned by two levels of the n -cube, II (2020) (3)
On the average size of sets in intersecting Sperner families (2002) (3)
Testing Functional Connection between Two Random Variables (2013) (2)
Intersecting Balanced Families of Sets (2001) (2)
On the distance of databases (2010) (2)
Minimum average-case queries of q+1-ary search game with small sets (2012) (2)
Analytic Odd Mean Labeling Of Some Standard Graphs (2019) (2)
On strengthenings of the intersecting shadow theorem (2021) (2)
A p-part Erdős-Ko-Rado theorem (2016) (2)
Existence of a Maximum Balanced Matching in the Hypercube (2013) (2)
Two-colorings with many monochromatic cliques in both colors (2013) (2)
An extremal problem on trees and database theory (2005) (1)
Color the cycles (2013) (1)
The Principle of Conservation of Entropy (1970) (1)
New results on intersecting families of subsets (2019) (1)
Length of Sums in a Minkowski Space (2004) (1)
A generalization of the independence number (2022) (1)
An extremal problem on labelled directed trees and applications to database theory (2005) (1)
Sums of Vectors and Turán's Graph Problem (1983) (1)
Preface: Levon Khachatrian's legacy in extremal combinatorics (2017) (1)
Large deviations and perturbations of random walks and random surfaces (1998) (1)
Recent combinatorial results in the theory of relational databases (2003) (1)
C O ] 2 1 N ov 2 01 9 The domination number of the graph defined by two levels of the ncube , II (2019) (1)
Search When the Lie Depends on the Target (2013) (1)
The largest component in a random subgraph of the n-cycle (1993) (1)
Excluded subposets in the Boolean lattice (2005) (1)
Results on intersecting families of subsets, a survey (2020) (1)
Results on the Wiener profile (2018) (0)
Preface (2005) (0)
Connections with Noiseless Encoding (1972) (0)
Forbidden inclusion patterns in families of subsets (2006) (0)
Some novelties on intersecting families of subsets (2020) (0)
Union-Intersecting Set Systems (2014) (0)
Towards a structured Baranyai theorem (2013) (0)
Preface (2017) (0)
Constructing Union-Free pairs of K-Element subsets (2013) (0)
Preface (1996) (0)
On the Number of Unions in a Family of Sets a (1989) (0)
Preface: 2nd Russian-Hungarian Combinatorial Workshop (2020) (0)
Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein" (2021) (0)
Largest Family Without a Pair of Posets on Consecutive Levels of the Boolean Lattice (2020) (0)
AN OPTIMAL COLORING FROM A BODY OF REVOLUTION (2011) (0)
Rényi 100, Quantitative and qualitative (in)dependence (2021) (0)
Gallai Ramsey number for double stars. (2020) (0)
More General Channels, more General Codes (1970) (0)
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets (2019) (0)
A PROBLEM FOR ABELIAN GROUPS (2008) (0)
Obituary (1979) (0)
Semantics in Databases (Dagstuhl Seminar 01021) (2021) (0)
Memories on Shadows and Shadows of Memories (2013) (0)
Erdös-Ko-Rado from intersecting shadows (2012) (0)
C O ] 2 2 Ju l 2 00 4 Largest family without A ∪ B ⊆ C ∩ (2008) (0)
On the size of the largest P-free families (2015) (0)
A general 2-part Erd\H os-Ko-Rado theorem (2017) (0)
Generalizations of Classical Theorems in Extremal Set Theory (2011) (0)
Report of the Round Table on Mathematical Games (1998) (0)
On the distance of databases (2012) (0)
Sperner Type Theorems 1 (2008) (0)
Shannon’s Theorem on Noiseless Channels (1970) (0)
Random Geometric Identification (2008) (0)
ON THE NUMBER OF DISTINCT RADII OF CIRCLES DETERMINED BY TRIPLETS AND ON PARAMETERS OF OTHER CURVES (2003) (0)
– Ko – Rado from intersecting shadows (0)
Dependencies in composite databases (1985) (0)
Entropy with Respect to a Cost Scale (1970) (0)
Proceedings of the 2nd international conference on Semantics in databases (2001) (0)
Civil Conflict: Ended Or Never Ending? (1999) (0)
A PARTIAL REFINING OF THE ERDŐS-KELLY REGULATION (2018) (0)
Incomparable Copies of a Poset in the Boolean Lattice (2015) (0)
Finite-State Channels (1970) (0)
Bounds on Maximal Families of Sets Not Containing Three Sets with A INTERSECTION B SUBSET OF C , A NOT A SUBSET OF B (2008) (0)
Largest Family Without a Pair of Posets on Consecutive Levels of the Boolean Lattice (2021) (0)
The Capacity of a Memoryless Channel (1970) (0)
A brief biographical sketch of Paul Erdős (1997) (0)

This paper list is powered by the following services:

Other Resources About Gyula O. H. Katona

en.wikipedia.org

What Schools Are Affiliated With Gyula O. H. Katona?

Gyula O. H. Katona is affiliated with the following schools:

Eötvös Loránd University

Image Attributions

Image Source for Gyula O. H. Katona