Gyula O. H. Katona

From MaRDI portal
Person:172210

Available identifiers

zbMath Open katona.gyula-o-hDBLP23/348WikidataQ269167 ScholiaQ269167MaRDI QIDQ6481731

List of research outcomes





PublicationDate of PublicationType
Intersecting V-free, \(\wedge\)-free families2024-11-13Paper
Adaptive majority problems for restricted query graphs and for weighted sets2024-10-18Paper
Extremal graphs without long paths and large cliques2024-06-28Paper
Some novelties on intersecting families of subsets2024-04-25Paper
Towards a Baranyai theorem with additional condition2023-12-14Paper
A generalization of the independence number2022-09-15Paper
Largest family without a pair of posets on consecutive levels of the Boolean lattice2022-05-23Paper
The Turán number of the square of a path2021-12-07Paper
On strengthenings of the intersecting shadow theorem2021-08-25Paper
Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein”2021-07-23Paper
The domination number of the graph defined by two levels of the \(n\)-cube2021-05-19Paper
The number of triangles is more when they have no common vertex2021-03-25Paper
The domination number of the graph defined by two levels of the \(n\)-cube. II2021-02-08Paper
Results on intersecting families of subsets, a survey2020-12-02Paper
Adaptive majority problems for restricted query graphs and for weighted sets2020-11-02Paper
Largest family without a pair of posets on consecutive levels of the Boolean lattice2020-03-18Paper
Gallai Ramsey number for double stars2020-01-08Paper
Existence of a maximum balanced matching in the hypercube2019-08-27Paper
A general 2-part Erdȍs-Ko-Rado theorem2018-10-23Paper
Results on the Wiener profile2018-06-20Paper
Around the complete intersection theorem2017-03-15Paper
Incomparable copies of a poset in the Boolean lattice.2015-11-09Paper
A coding problem for pairs of subsets2015-10-20Paper
Union-intersecting set systems2015-09-24Paper
Two-colorings with many monochromatic cliques in both colors2014-10-16Paper
Turán's graph theorem, measures and probability theory2014-08-12Paper
https://portal.mardi4nfdi.de/entity/Q54200222014-06-11Paper
Constructing union-free pairs of \(k\)-element subsets2014-04-07Paper
Color the cycles2013-12-06Paper
Sperner type theorems with excluded subposets2013-11-29Paper
https://portal.mardi4nfdi.de/entity/Q53270682013-08-01Paper
Testing Functional Connection between Two Random Variables2013-07-08Paper
Majority and plurality problems2013-04-18Paper
Search When the Lie Depends on the Target2013-04-09Paper
On the distance of databases2013-01-04Paper
Erdös-Ko-Rado from intersecting shadows2012-11-08Paper
Most probably intersecting families of subsets2012-05-14Paper
Minimum average-case queries of \(q+1\)-ary search game with small sets2012-05-04Paper
Random Databases with Correlated Data2012-03-09Paper
Finding at least one excellent element in two rounds2011-05-23Paper
https://portal.mardi4nfdi.de/entity/Q35766942010-07-30Paper
An extremal problem on trees and database theory2010-07-30Paper
Foundations of Information and Knowledge Systems2009-05-14Paper
Forbidden intersection patterns in the families of subsets2009-03-24Paper
Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)2008-11-17Paper
A PROBLEM FOR ABELIAN GROUPS2008-08-26Paper
Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)2008-07-01Paper
No four subsets forming an \(N\)2008-05-13Paper
Codes that attain minimum distance in every possible direction2008-05-06Paper
Functional dependencies distorted by errors2008-03-28Paper
Largest families without an \(r\)-fork2007-12-17Paper
Forbidden inclusion patterns in families of subsets2007-05-29Paper
A coding problem for pairs of subsets2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34288592007-03-29Paper
Foundations of Information and Knowledge Systems2007-02-12Paper
Foundations of Information and Knowledge Systems2007-02-12Paper
On the security of individual data2006-09-12Paper
Two-Part and k-Sperner Families: New Proofs Using Permutations2006-06-01Paper
2-Bases of Quadruples2006-03-13Paper
Constructions via Hamiltonian theorems2005-12-29Paper
Largest family without \(A \cup B \subseteq C \cap D\)2005-09-28Paper
New type of coding problem motivated by database theory2004-11-12Paper
Recent combinatorial results in the theory of relational databases2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44722112004-08-04Paper
Strong qualitative independence.2004-02-14Paper
https://portal.mardi4nfdi.de/entity/Q44134412003-07-20Paper
On the average size of sets in intersecting Sperner families2002-12-02Paper
A new type of coding problem2002-10-20Paper
Search with small sets in presence of a liar2002-01-01Paper
Intersecting balanced families of sets2001-11-09Paper
https://portal.mardi4nfdi.de/entity/Q27288322001-11-06Paper
Pairs of disjoint \(q\)-element subsets far from each other2001-10-16Paper
https://portal.mardi4nfdi.de/entity/Q45040052000-09-14Paper
Design type problems motivated by database theory2000-03-21Paper
https://portal.mardi4nfdi.de/entity/Q49450592000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42691731999-10-31Paper
A simple proof of a theorem of Milner1999-01-14Paper
Asymptotic properties of keys and functional dependencies in random databases1998-06-30Paper
A brief biographical sketch of Paul Erdős1997-07-28Paper
Extremal problems for finite sets and convex hulls---a survey1997-07-13Paper
A survey of some combinatorial results concerning functional dependencies in database relations.1997-05-13Paper
https://portal.mardi4nfdi.de/entity/Q56890091997-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48538101996-02-22Paper
https://portal.mardi4nfdi.de/entity/Q42846101994-03-24Paper
The largest component in a random subgraph of the \(n\)-cycle1994-01-06Paper
Greedy construction of nearly regular graphs1993-08-25Paper
Optimization of the reliability polynomial in presence of mediocre elements1993-08-23Paper
https://portal.mardi4nfdi.de/entity/Q52861301993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q52861311993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40359981993-05-16Paper
Partial dependencies in relational databases and their realization1993-01-31Paper
The characterization of branching dependencies1993-01-31Paper
https://portal.mardi4nfdi.de/entity/Q39721321992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39720071992-06-25Paper
On the number of databases and closure operations1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37922781988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34963361987-01-01Paper
The poset of closures as a model of changing databases1987-01-01Paper
All maximum 2-part Sperner families1986-01-01Paper
Convex hulls of more-part Sperner families1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37477651986-01-01Paper
Extremal hypergraph problems and convex hulls1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37465761985-01-01Paper
Minimum matrix representation of closure operations1985-01-01Paper
Polytopes determined by hypergraph classes1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187181985-01-01Paper
Dependencies in composite databases1985-01-01Paper
Intersecting Sperner families and their convex hulls1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33171451984-01-01Paper
Extremal problems in relational data bases1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33155391983-01-01Paper
Minimal 2-coverings of a finite affine space based on GF(2)1983-01-01Paper
Sums of Vectors and Turán's Graph Problem1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33133061983-01-01Paper
?Best? estimations on the distribution of the length of sums of two random vectors1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33329991982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47492471982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39191221981-01-01Paper
Sums of vectors and Turan's problem for 3-graphs1981-01-01Paper
Continuous versions of some extremal hypergraph problems. II1980-01-01Paper
On the number of maximal dependencies in a data base relation of fixed order1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39127951980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39414111979-01-01Paper
Graphs with maximal number of adjacent pairs of edges1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41733881978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39444951978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41985101978-01-01Paper
Contributions to the geometry of Hamming spaces1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41409991977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38783181977-01-01Paper
Inequalities for the Distribution of the Length of Random Vector Sums1977-01-01Paper
Huffman codes and self-information1976-01-01Paper
Extensions of the Erdös-Ko-Rado Theorem1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40972911975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40521701974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40415821974-01-01Paper
Solution of a problem of A. Ehrenfeucht and J. Mycielski1974-01-01Paper
Two applications (for search theory and truth functions) of Sperner type theorems1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51832601973-01-01Paper
A simple proof of the Erdős-Chao Ko-Rado theorem1972-01-01Paper
A generalization of some generalizations of Sperner's theorem1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32149321972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47707601972-01-01Paper
Matching problems1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56354141971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56102801970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56801311970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56266711970-01-01Paper
General Theory of Noiseless Channels1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55820981969-01-01Paper
Information sources with different cost scales and the principle of conservation of entropy1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40717521968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55453021968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56076321968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55259161967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55321561967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55183991966-01-01Paper
On separating systems of a finite set1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55127961964-01-01Paper
Intersection theorems for systems of finite sets1964-01-01Paper

Research outcomes over time

This page was built for person: Gyula O. H. Katona