[1]. G. Katona, Intersection theorems for systems of finite sets, Acta Math. Acad. Sci. Hungar. 15 (1964) 329-337.
Download: pdf
[2]. G. Katona, T. Nemetz and M. Simonovits, On a graph-problem of Turán (in a Hungarian), Mat. Lapok 15 (1964) 228-238.
Download: pdf
[3]. G. Katona, On a conjecture of Erd?s and a stronger form of Sperner's theorem, Studia Sci. Math. Hungar. 1 (1966) 059-063.
Download: pdf
[4]. G. Katona, On separating systems of a finite set, J. Combin. Theory 1 (1966) 174-194.
Download: pdf
[5]. G. Katona and E. Szemerédi, On a problem of graph theory, Studia Sci. Math. Hungar. 2 (1967) 023-028.
Download: pdf
[6]. G. Katona and G. Tusnádi, The principle of conservation of entropy in a noiseless channel, Studia Sci. Math. Hungar. 2 (1967) 029-035.
Download: pdf
[7]. G. Katona, A theorem of finite sets, Theory of Graphs, Proc. Coll. held at Tihany, Hungary, September, 1966 (Akadémiai Kiadó, Budapest, 1968) 187-207, reprinted in Classic Papers in Combinatorics, Ed. I. Gessel and G.-C. Rota, Birkhäuser, Boston, 1987.
Download: pdf
[8]. G. Katona, Sperner type theorems, Ph. D. thesis, Eötvös Loránd University, Budapest, 1968.
Download: pdf
[9]. I. Csiszár, G. Katona and G. Tusnády, Information sources with different cost scales and the principle of conservation of entropy, Proc. of the Coll. on Information Theory, Debrecen, Hungary, 1967, (Bolyai János Math. Soc., Budapest, 1968) 101-128.
Download: pdf
[10]. G. Katona and G. Korvin, Functions defined on a directed graph, Theory of Graphs, Proc. Coll. held at Tihany, Hungary, September, 1966 (Akadémiai Kiadó, Budapest, 1968) 209-213.
Download: pdf
[11]. G. Katona, Graphs, vectors and inequalities in probability theory, (in Hungarian) Mat. Lapok 20 (1969) 123-127.
Download: pdf
[12]. I. Csiszár, G. Katona and G. Tusnády, Information sources with different cost scales and the principle of conservation of entropy, Z. Wahrsch. Verw. Gebiete 12 (1969) 185-222.
Download: pdf
[13]. G. Katona and T. Nemetz, Some remarks on the shift register generators (in Hungarian,) Számítástechnikai Kutató Intézet Közleményei 5 (1969) July, 007-027.
Download: pdf
[14]. G. Katona, How many sums of vectors can lie in a circle of radius √2? Combin. Theory and its Appl., Balatonfüred, Hungary, 1969, Coll. Math. Soc. J. Bolyai 4 (Math. Soc. J. Bolyai, Budapest, 1970) 687-693.
Download: pdf
[15]. G.O.H. Katona and D.O.H. Szász, Matching problems, Combin. Theory and its Appl., Balatonfüred, Hungary, 1969, Coll. Math. Soc. J. Bolyai 4 (Math. Soc. J. Bolyai, Budapest, 1970) 695-703.
Download: pdf
[16]. G.O.H. Katona and D.O.H. Szász, Matching problems, J. Combin. Theory Ser. B 10 (1971) 060-092.
Download: pdf
[17]. G. Katona, Sperner type theorems, Dissertation for “candidate” degree, Hungarian Academy of Sciences, Budapest, 1972 (in Hungarian).
[17a]. Az elozo tezisei. (The abstract of [17].) (In Hungarian.)
Download: pdf (in Hungarian)
[18]. G.O.H. Katona, A generalization of some generalizations of Sperner's theorem, J. Combin. Theory Ser. B 12 (1972) 072-081.
Download: pdf
[19]. G.O.H. Katona, Families of subsets having no subset containing another one with small difference, Nieuw Arch. Wiskunde (3) 20 (1972) 054-067.
Download: pdf
[20]. G.O.H. Katona, A simple proof of the Erdős-Chao Ko-Rado theorem, J. Combin. Theory Ser. B 13 (1972) 183-184.
Download: pdf
[21]. G.O.H. Katona and M.A. Lee, Some remarks on the construction of optimal codes, Acta Math. Acad. Sci. Hungar. 23 (1972) 439-442.
Download: pdf
[22]. G.O.H. Katona, Two applications (for search theory and truth functions) of Sperner type theorems, Period. Math. Hungar. 3 (1973) 019-026.
Download: pdf
[23]. G. Katona, A three part Sperner theorem, Studia Sci. Math. Hungar. 8 (1973) 379-390.
Download: pdf
[24]. G.O.H. Katona, Combinatorial Search Problems, A survey of combinatorial theory (Ed. by J.N. Srivastava, North Holland/American Elsevier, Amsterdam/New York, 1973) 285-308.
Download: pdf
[25]. G.O.H. Katona, Solution of a problem of A. Ehrenfeucht and J. Mycielski, J. Combin. Theory Ser. A 17 (1974) 265-266.
Download: pdf
[26]. G.O.H. Katona, Extremal problems for hypergraphs, Combinatorics (Ed. by M. Hall, Jr. and J.H. van Lint, D. Reidel, Dordrecht/Boston, 1975) 215-244 and Mathematical Centre Tracts 56, Amsterdam, 1974, Part 2, 013-042.
Download: pdf
[27]. G.O.H. Katona, The Hamming-sphere has minimum boundary, Studia Sci. Math. Hungar. 10 (1975) 131-140.
Download: pdf
[28]. C. Greene, G.O.H. Katona and D.J. Kleitman, Extensions of the Erd?s-Ko-Rado theorem, Recent Advances in Graph Theory, Proc. Symp. held in Prague, June 1974 (Academia Prague, 1975) 223-231.
Download: pdf
[29]. G.O.H. Katona and T.O.H. Nemetz, Huffman codes and self-information, IEEE Trans. Inform. Theory 22 (1976) 337-340.
Download: pdf
[30]. C. Greene, G.O.H. Katona and D.J. Kleitman, Extensions of the Erdős-Ko-Rado theorem, Stud. Appl. Math. 55 (1976) 001-008.
Download: pdf
[31]. G.O.H. Katona, Inequalities concerning the length of sums of random vectors (in Russian), Teor. Verojatnost i Primenen. 22 (1977) 466-481, translation: Theory Probab. Appl. 22 450-464.
Download: pdf
[32]. G.O.H. Katona, On a problem of L. Fejes Tóth, Studia Sci. Math. Hungar. 12 (1977) 077-080.
Download: pdf
[33]. R. Ahlswede and G.O.H. Katona, Contributions to the geometry of Hamming spaces, Discrete Math. 17 (1977) 001-022.
Download: pdf
[34]. G.O.H. Katona, Continuous versions of some extremal hypergraph problems, Combinatorics, Keszthely (Hungary), 1976, Coll. Math. Soc. J. Bolyai 18 (Math. Soc. J. Bolyai, Budapest, 1978) 653-678.
Download: pdf
[35]. G.O.H. Katona, Optimization for order ideals under a weight assignment, Problemes combinatoires et theorie des graphes, Orsay, 1976, Coll. internationaux C.N.R.S., 260 (C.N.R.S., Paris, 1978) 257-258.
Download: pdf
[36]. G.O.H. Katona, Search using sets with small intersection, Theorie de l'information, Coll. internationaux C.N.R.S., 276
Download: pdf (C.N.R.S., Paris, 1978) 381-388.
[37]. R. Ahlswede and G.O.H. Katona, Graphs with maximal number of adjacent pairs of edges, Acta Math. Acad. Sci. Hungar. 32 (1978) 097-120.
Download: pdf
[38]. P. Frankl and G.O.H. Katona, If the intersection of any r sets has a size ≠ r−1, Studia Sci. Math. Hungar. 14 (1979) 047-049.
Download: pdf
[39]. G.O.H. Katona, Continuous versions of some extremal hypergraph problems II, Acta Math. Acad. Sci. Hungar. 35 (1980) 067-077.
Download: pdf
[40]. A. Békéssy, J. Demetrovics, L. Hannák, P. Frankl and G.O.H. Katona, On the number of maximal dependencies in a data base relation of fixed order, Discrete Math. 30 (1980) 083-088.
Download: pdf
[41]. G.O.H. Katona and B.S. Stechkin, Combinatorial numbers, geometric constants and probabilistic inequalities (in Russian), Dokl. Akad. Nauk. SSSR 251 (1980) 1293-1296.
Download: pdf
[41eng]. English version of [41].) Soviet Math. Dokl. 21 (1980) 610-613.
Download: pdf
[42]. G.O.H. Katona, Sums of vectors and Turán's problem for 3-graphs, European J. Combin. 2 (1981) 145-154.
Download: pdf
[43]. J. Demetrovics and G.O.H. Katona, Extremal combinatorial problems in relational data base, Fundamentals of Computation Theory 81, Proc. of the 1981 International FCT-Conference, Szeged, Hungary, 1981, Lecture Notes in Computer Science, 117 (Springer Verlag, Berlin, 1981) 110-119.
Download: pdf
[44]. G.O.H. Katona, “Best” estimations on the distribution of the length of sums of two random vectors, Z. Wahrsch. Verw. Gebiete 60 (1982) 411-423.
Download: pdf
[45]. J. Demetrovics and G.O.H. Katona, Extremal problems of relational data bases, Alkalmaz. Mat. Lapok 8 (1982) 183-193.
Download: pdf
[46]. G.O.H. Katona, Sums of vectors and Turán's graph problem, Ann. Discrete Math. 17 (1983) 377-382.
Download: pdf
[47]. J. Demetrovics, Z. Füredi and G.O.H. Katona, The relation between the number of individuals and dependencies in composed data bases (in Hungarian), Alkalmaz. Mat. Lapok 9 (1983) 013-021.
Download: pdf
[48]. G.O.H. Katona and J.N. Srivastava, Minimal 2-coverings of a finite affine space based on GF(2), J. Statist. Plann. Inference 8 (1983) 375-388.
Download: pdf
[49]. G.O.H. Katona and T. Tarján, Extremal problems with excluded subgraphs in the n-cube, Graph Theory, Lagow, 1981, Lecture Notes in Math. 1018 (Springer-Verlag, Berlin, 1983) 084-093.
Download: pdf
[50]. G.O.H. Katona, Convex hulls of hypergraph classes, Proc. of the Fourth Yugoslav Seminar on Graph Theory, Novi Sad, 1983 (Univ. Novi Sad, Novi Sad, 1984) 177-190.
Download: pdf
[51]. J. Demetrovics and G.O.H. Katona, Extremal problems of relational data bases (in Russian), Kibernetika (Kiev) (6) 1984 033-037, 69.
Download: pdf
[52]. Peter L. Erdős, P. Frankl and G.O.H. Katona, Intersecting Sperner families and their convex hulls, Combinatorica 4 (1984) 021-034.
Download: pdf
[53]. G.O.H. Katona, Extreme more-part Sperner families, Graphs, Hypergraphs and Applications, Proc. of the Conf. on Graph Theory held in Eyba, 1984, Teubner-Texte zur Math. 73 (Ed. by H. Sachs, Teubner, Leipzig, 1985) 096-101.
Download: pdf
[54]. G.O.H. Katona, Probabilistic inequalities from extremal graph results (a survey), Ann. Discrete Math. 28 (1985) 159-170.
Download: pdf
[55]. J. Demetrovics, Z. Füredi and G.O.H. Katona, The relation between the number of individuals and dependencies in composed data bases, Kibernetika (Kiev) (5) 1985 107-110, 115.
Download: pdf
[56]. J. Demetrovics, Z. Füredi and G.O.H. Katona, Minimum matrix representation of closure operations, Discrete Appl. Math. 11 (1985) 115-128.
Download: pdf
[57]. Peter L. Erdős, P. Frankl and G.O.H. Katona, Extremal hypergraph problems and convex hulls, Combinatorica 5 (1985) 011-026.
Download: pdf
[58]. P. Frankl and G.O.H. Katona, Polytopes determined by hypergraph classes, European J. Combin. 6 (1985) 233-243.
Download: pdf
[59]. J. Demetrovics and G.O.H. Katona, Combinatorial problems of database models, Algebra, Combinatorics and Logic in Computer Science, Gy?r, Hungary, 1983, Coll. Math. Soc. J. Bolyai 42 (Math. Soc. J. Bolyai, Budapest, 1986) 331-353.
Download: pdf
[60]. Peter L. Erdős, P. Frankl and G.O.H. Katona, Convex hulls of more-part Sperner families, Graphs and Combinatorics 2 (1986) 123-134.
Download: pdf
[61]. Peter L. Erdős and G.O.H. Katona, All maximum 2-part Sperner families, J. Combin. Theory Ser. A 43 (1986) 058-069.
Download: pdf
[62]. G. Burosch, J. Demetrovics and G.O.H. Katona, The poset of closures as a model of changing databases, Order 4 (1987) 127-142.
Download: pdf
[63]. Peter L. Erdős and G.O.H. Katona, A 3-part Sperner theorem, Studia Sci. Math. Hungar. 22 (1987) 383-393.
Download: pdf
[64]. G.O.H. Katona, A. Kostochka, J. Pach and B.S. Stechkin, Locally Hamiltonian graphs, Mat. Zametki 45 (1989) 036-042.
Download: pdf
[65]. J. Demetrovics, G.O.H. Katona and P.P. Pálfy, On the number of unions in a family of sets, Combinatorial Mathematics, Proc. of the 3rd International Conference, Annals of the New York Academy of Sciences, Vol. 555 Ed. G.S. Bloom, R.L. Graham, J. Malkevitch, 1989, pp. 150-158.
Download: pdf
[66]. J. Demetrovics and G.O.H. Katona, Extremal combinatorial problems of database models, MFDBS 87, 1st Symposium on Mathematical Fundamentals of Database Systems, Dresden, GDR, January, 1987, Springer Verlag, Lecture Notes in Computer Science, 305, 1987, 099-127.
Download: pdf
[67]. G. Burosch, J. Demetrovics, G.O.H. Katona, D.J. Kleitman and A.A. Sapozhenko, On the number of databases and closure operations, Theoretical Computer Science, 78 (1991) 377-381.
Download: pdf
[68]. J. Demetrovics, G.O.H. Katona and D. Miklós, Partial dependencies in relational databases (in Hungarian), Alk. Mat. Lapok, 15 (1990-91) 163-179.
Download: pdf
[69]. J. Demetrovics, G.O.H. Katona and A. Sali, Branching dependencies in relational databases (in Hungarian), Alk. Mat. Lapok, 15 (1990-91) 181-196.
Download: pdf
[70]. G.O.H. Katona and G. Schild, Linear inequalities describing the class of Sperner families of subsets, I, Topics in Combinatorics and Graph Theory (Essays in Honour of Gerhard Ringel), Ed. R. Boedendick and R. Henn, Physica-Verlag, Heildelberg, 1990. pp. 413-420.
Download: pdf
[71]. G.O.H. Katona, A.F. Sidorenko and B.S. Stechkin, Inequalities valid in the class of all distributions, First World Congress of the Bernoulli Society Nauka, Moscow, 1986, Vol. 2., page 500.
[72]. G. Burosch, J. Demetrovics, G.O.H. Katona, D.J. Kleitman and A.A. Sapozhenko, On the number of closure operations, Combinatorics, Paul Erdős is Eighty, Vol. 1, Keszthely (Hungary), 1993, Bolyai Society Mathematical Studies, 1, Bolyai János Mathematical Society, Budapest, 1994, 091-105.
Download: pdf
[73]. G.O.H. Katona and L. Quintas, The largest component in a random subgraph of the n-cycle, Discrete Math., 121 (1993) 113-116.
Download: pdf
[74]. J. Demetrovics, G.O.H. Katona and D. Miklós, Partial dependencies in relational databases and their realization, Discrete Appl. Math., 40 (1992) 127-138.
Download: pdf
[75]. J. Demetrovics, G.O.H. Katona and A. Sali, The characterization of branching dependencies, Discrete Appl. Math., 40 (1992) 139-153.
Download: pdf
[76]. G.O.H. Katona, Rényi and the Combinatorial Search Problems, Studia Sci. Math. Hungar. 26 (1991) 363-378.
Download: pdf
[77]. J. Demetrovics and G.O.H. Katona, A survey of some combinatorial results concerning functional dependencies in relational databases, Annals of Mathematics and Artificial Intelligence 7 (1993) 063-082.
Download: pdf
[78]. G.O.H. Katona and W. Woyczyński, Optimization of the reliability polynomial in presence of mediocre elements, Networks 23 (1993) 327-332.
Download: pdf
[79]. G.O.H. Katona and A. Seress, Greedy construction of nearly regular graphs, European J. Combin. 14 (1993) 213-229.
Download: pdf
[80]. G.O.H. Katona, Combinatorial and Algebraic Results for Database Relations, Database Theory - ICDT'92 (Berlin, 1992), pp. 001-020, Lecture Notes in Comput. Science, 646, (Ed. J. Biskup and R. Hull), Springer Verlag, Berlin, 1992.
Download: pdf
[81]. G.O.H. Katona, Shedding some lights on shadows, Combinatorics, Graph Theory, Algorithms and Applications, Beijing, 1993, Editors Y. Alavi, D.A. Lick, Jiuqiang Liu, World Scientific, 1994, 099-109.
Download: pdf
[82]. J. Demetrovics, G.O.H. Katona and A. Sali, Minimal Representations of Branching Dependencies, Acta Sci. Math. (Szeged) 60 (1995) 213-223.
Download: pdf
[83]. J.Demetrovics, G.O.H. Katona, D. Miklós, O. Seleznjev and B. Thalhei, The Average Length of Keys and Functional Dependencies in (Random) Databases, Database Theory ICDT'95 (Prague, 1995) Lecture Notes in Comput. Science, 893 (Eds. G. Gottlob and Moshe Y. Vardi), Springer Verlag, 1995, 266-279.
Download: pdf
[84]. G.O.H. Katona, Extremal problems for finite sets and convex hulls, a survey, Discrete Math. 164 (1997) 175-185.
Download: pdf
[85]. J. Demetrovics, G.O.H. Katona and A. Sali, Design type problems motivated by database theory, J. Statist. Planning Infer. 72 (1998) 149-164.
Download: pdf
[86]. G.O.H. Katona, A simple proof of a theorem of Milner, J. Combin. Theory Ser. A 83 (1998) 138-140.
Download: pdf
[87]. J.Demetrovics, G.O.H. Katona, D. Miklós, O. Seleznjev and B. Thalheim, Asymptotic properties of keys and functional dependencies in random databases, Theoretical Comp. Sci. 190 (1998) 151-166.
Download: pdf
[88]. J.Demetrovics, G.O.H. Katona, D. Miklós, O. Seleznjev and B. Thalheim, Functional dependencies in random databases, Studia Sci. Math. Hungar. 34 (1998) 127-140.
Download: pdf
[89]. G.O.H. Katona, Search with small sets in presence of a liar, J. Statictical Planning and Inference 100 (2002) 319-336.
Download: pdf
[90]. A. Idzik, G.O.H. Katona and R. Vohra, Intersecting balanced families of sets, J. Combin. Theory Ser. A 93 (2001) 281-291.
Download: pdf
[91]. G.O.H. Katona, The cycle method and its limits, in: Numbers, Information and Complexity, (I. Althöfer, Ning Cai, G. Dueck, L. Khachatrian, M.S. Pinsker, A. Sárközy, I. Wegener, Zhen Zhang, eds.), Kluwer, 2000, pp. 129-141.
Download: pdf
[92]. H. Enomoto and G.O.H. Katona, Pairs of disjoint q-element subsets far from each other, Electronic J. Combin. 8 (No. 2)(2001),# R7
Download: pdf
[93]. J. Demetrovics, G.O.H. Katona and D. Miklós, Error-Correcting Keys in Relational Databases, in Foundations of Information and Knowledge Systems, (Burg, 2000), Lecture Notes in Computer Science 1762, (Eds. Klaus-Dieter Schewe and Bernhard Thalheim) Springer Verlag, Berlin, 2000, pp. 088-093.
Download: pdf
[94]. Ch. Bey, K. Engel, G.O.H. Katona, and U. Leck, On the average size of sets in intersecting Sperner families, Discrete Math. 257 (2002) 259-266.
Download: pdf
[95]. G.O.H. Katona, Research Problem 339, Discrete Math. 213 (2000) 355-356.
Download: pdf
[96]. Peter L. Erdős, Z. Füredi and G.O.H. Katona, Two-part and k-Sperner families: new proofs using permutations, SIAM J. Discrete Math. 19 (2005) 489-500.
Download: pdf
[97]. G. Brightwell and G.O.H. Katona, A new type of coding problem, Studia Sci Math. Hungar. 38 (2001) 139-147.
Download: pdf
[98]. F. Glatz and G.O.H. Katona, A linguistic-historic model (in Hungarian), in: Közgy?lési El?adások, (A Matematikai Tudományok Osztálya), 2000. május, MTA, Budapest, 2002.
Download: pdf
[99]. J. Demetrovics, G.O.H. Katona and D. Miklós, Functional dependencies in presence of errors, in: Foundations of Information and Knowledge Systems (Salzau Castle, 2002), Lecture Notes in Computer Science 2284 (Eds. Thomas Eiter and Klaus-Dieter Schewe), Springer Verlag, Berlin, 2002, pp. 085-092.
Download: pdf
[100]. G.O.H. Katona, Strong qualitative independence, Discrete Applied Math. 137 (2004) 087-095.
Download: pdf
[101]. J. Demetrovics, G.O.H. Katona and D. Miklós, Functional dependencies distorted by errors, Discrete Applied Math. 156 (2008) 862-869.
Download: pdf
[102]. G.O.H. Katona and A. Sali, New type of Coding Problem Motivated by Database Theory, Discrete Appl. Math. 144 (2004) 140-148.
Download: pdf
[103]. J. Demetrovics, G.O.H. Katona and D. Miklós, Recent Combinatorial Results in the Theory of Relational Databases, Math. and Computer Modelling, 38 (2003) 763-772.
Download: pdf
[104]. Gyula O.H. Katona, Constructions via Hamiltonian theorems, Discrete Math., 303 (2005) 087-103.
Download: pdf
[105]. Z. Füredi and G.O.H. Katona, 2-bases of quadruples, Combinatorics, Probability and Computing, 15 (2006) 131-141.
Download: pdf
[106]. Gyula O.H. Katona, Richard Mayer and Wojbor Woyczyński, Length of sums in a Minkowski space, in: Towards a Theory of Geometric Graphs. (J. Pach Ed.), Contemporary Mathematics, 342, AMS, 2004 pp. 113-118.
Download: pdf
[107]. L. Bertossi, G.O.H. Katona, K.-D. Schewe and B. Thalheim, Semantics in databases, in: Semantics in Databases (Second International Workshop, Dagstuhl Castle, Germany, 2001), Lecture Notes in Computer Science, 2582; (Eds L. Bertossi, G.O.H. Katona, K.-D. Schewe and B. Thalheim) Springer-Verlag Berlin Heidelberg; 2003; 001-006.
Download: pdf
[108]. J. Demetrovics, G.O.H. Katona and D. Miklós, On the Security of Individual Data, in: Foundations of Information and Knowledge Systems (Wilheminenburg Castle, 2004), Lecture Notes in Computer Science 2942 (Eds. Dietmar Seipel and José María Turull-Torres), Springer Verlag, Berlin, 2004, pp. 049-058.
Download: pdf
[109]. Annalisa De Bonis, G.O.H. Katona and Konrad Swanepoel, Largest family without A ∪ B ⊂ C ∩ D, J. Combin. Theory Ser. A 111 (2005) 331-336.
Download: pdf
[110]. J. Demetrovics, G.O.H. Katona and D. Miklós, On the security of individual data, Annals of Mathematics and Artificial Intelligence 46 (2006) 098-113.
Download: pdf
[112]. L. Csirmaz and G.O.H. Katona, Geometric codes (in Hungarian) Alkal. Mat. Lapok 23 (2006) 349-361. see also: Geometric cryptography, in Proc. International Worshop on Coding and Cryptography, 2003. 8 citations according to scholar.google, the final version exists in form of manuscript: Geometric cryptography.
[113]. Béla Bollobás, Zoltán Füredi, Ida Kantor, G.O.H. Katona, Imre Leader, A coding problem for pairs of subsets in: Geometry, Structure and Randomness in Combinatorics (Jiri Matousek, Jaroslav Nesetril and Marco Pellegrini Eds.)Edizioni Della Normale, CRM Series 18(2015), pp. 47-58.
Download: pdf
[114]. János Demetrovics, Gyula O.H. Katona, Dezs? Miklós and Bernhard Thalheim, On the number of independent functional dependencies, in: Foundations of Information and Knowledge Systems, Springer, LNCS 3861 2006, pp. 083-091.
Download: pdf
[115]. Gyula O.H. Katona and Krisztián Tichler, Some contributions to the Minimum Representation Problem of Key Sytems, in: Foundations of Information and Knowledge Systems, Springer, LNCS 3861 2006, pp. 240-257.
Download: pdf
[116]. Jerrold R. Griggs and Gyula O.H. Katona, No four subsets forming an N, J. Combin. Theory Ser. A 115 (2008) 677-685.
Download: pdf
[117]. Annalisa De Bonis and Gyula O.H. Katona, Largest families without an r-fork, Order 24 (2007) 181-191.
Download: pdf
[118]. L. Csirmaz and G.O.H. Katona, Geometric codes (in Hungarian), Alkal. Mat. Lapok 23 (2006) 349-361.
Download: pdf
[120]. Gyula O.H. Katona, Forbidden inclusion patterns in the families of subsets (introducing a method), in: Horizons of Combinatorics (Ervin Gy?ri, Gyula O.H. Katona, László Lovász Eds.) Bolyai Society Mathematical Studies, 17, Bolyai János Mathematical Society, Budapest and Springer-Verlag, 2008, pp. 119-140.
Download: pdf
[121]. Gyula O.H. Katona, A. Sali and K.-D. Schewe, Codes that attain minimum distance in every possible direction, Cent. Eur. J. Math. 6 (2008) 001-011.
Download: pdf
[122]. Teena Carroll and Gyula O.H. Katona, Bounds on maximal families of sets not containing three sets with A ∪ B ⊂ C, A ⊄ B, Order 25 (2008) 229-236.
Download: pdf
[123]. Gyula O.H. Katona and Leonid Makar-Limanov, A problem for Abelian groups, Asian-European Journal of Mathematics 1 (2008) 237-241.
Download: pdf
[124]. R. Anstee, J. Demetrovics, G.O.H. Katona and A. Sali, Low Discrepancy Allocation of Two-Dimensional Data, in: Foundations of Information and Knowledge Systems, (Burg, 2000), LNCS 1762, (Burg, 2000), (Eds. Klaus-Dieter Schewe and Bernhard Thalheim) Springer Verlag, Berlin, 2000, pp. 001-012.
Download: pdf
[125]. Galina Bogdanova and Gyula O.H. Katona, All q-ary equidistant 3-codes, Journal of Combinatorics, Information and System Sciences 34 (2009) 161-167.
Download: pdf
[126]. Gyula O.H. Katona, Forbidden Intersection Patterns in the Families of Subsets, in: Proc. ICDM 2006 (Conference in Bangalore), pp. 165-174.
Download: pdf
[127]. Gyula O.H. Katona, Finding at least one excellent element in two rounds, J. Statist. Planning Inference 141 (2011) 2946-2952.
Download: pdf
[128]. Gyula O.H. Katona, Keszler Anita and Attila Sali, On the Distance of Databases, Foundations of Information and Knowledge Systems, (Proceedings of the 6th International Symposium, FoIKS 2010, Sofia, Bulgaria, February, 2010, Sebastian Link, Henri Prade (eds.), LNCS 5956 pp. 76-93.
Download: pdf
[129]. Gyula O.H. Katona, Testing functional connection between two random variables, in: Prokhorov and Contemporary Probability Theory, (A.N. Shiryaev, S.R.S. Varadhan, E.L. Presman, editors) Springer, 2013, pp. 335-348.
Download: pdf
[130]. Gyula O.H. Katona, Sperner type theorems with excluded subposets, (Jubilee Conference on Discrete Mathematics) Discrete Appl. Math. 161 (2013) 1251-1258.
Download: pdf
[131]. Gyula O.H. Katona, Gyula Y. Katona and Zsolt Katona, Most probably intersecting families of subsets, Combinatorics, Probability, Computing 21 (2012) 219-227.
Download: pdf
[132]. Gyula O.H. Katona, Ákos Kisvölcsey, Erdős-Ko-Rado from intersecting shadows, Discussiones Mathematicae Graph Theory, 32(2012) 379-382.
Download: pdf
[133]. Gyula O.H. Katona, Random databases with correlated data, Conceptual Modelling and Its Theoretical Foundations, A. Düsterhöft, M. Klettke, and K.-D. Schewe (Eds.): Thalheim Festschrift 2011, LNCS 7260, pp. 29-35., Springer, Heidelberg (2012).
Download: pdf
[134]. Kun Meng, Chuang Lin, Wen An Liu, Yang Yang, Gyula O.H. Katona, Minimum average-case queries of $q+1$-ary search game with small sets, Discrete Appl. Math. 20(2012) 618-627.
Download: pdf
[135]. Gyula O.H. Katona, Constructing union-free pairs of $k$-element subsets, AKCE International J. Graphs and Combinatorics 10(2013) 111-117.
Download: pdf
[136]. Gyula O.H. Katona and Krisztián Tichler, Encoding Databases Satisfying a Given Set of Dependencies, Foundations of Information and Knowledge Systems, 7th International Symposium, FOiKS 2012, Kiel, Germany, March 2012, Proceedings, Thomas Lukasiewicz, Attila Sali, Edts. LNCS 7153, Springer, pp. 203-223.
Download: pdf
[137]. Gyula O.H. Katona and Zsolt Tuza, Color the cycles, Discrete Mathematics 313(2013) 2026-2033.
Download: pdf
[138]. Dániel Gerbner, Gyula O.H. Katona, Dömötör Pálvölgyi and Balázs Patkós, Majority and Plurality Problems, Discrete Applied Mathematics 161(2013) 813-818.
Download: pdf
[139]. Gyula O.H. Katona and Krisztián Tichler, Search when the lie depends on the target, in: Information Theory, Combinatorics, and Search Theory (In Memory of Rudolf Ahlswede) (H. Aydinian, F. Cicalese, Ch. Deppe, Eds.) LNCS 7777, Springer, 2013, 524-530.
Download: pdf
[140]. Gyula O.H. Katona and Krisztián Tichler, Existence of a maximum balanced matching in the hypercube, J. Statist. Theory and Practice 7(2013) 617-629.
Download: pdf
[141]. Peter Frankl, Mitsuo Kato, Gyula O.H. Katona and Norihide Tokushige, Two-coloring with many monochromatic cliques in both colors, J. Combin. Theory Ser B 103(2013) 415-427.
Download: pdf
[142]. Gyula O.H. Katona, Turán's graph theorem, measures and probability theory,, Number theory, analysis, and combinatorics, De Gruyter Proc. Math,. De Gruyter, Berlin, (2014). pp. 167-176.
Download: pdf
[143]. Gyula O.H. Katona, Daniel T. Nagy, Incomparable copies of a poset in the Boolean lattice, Order 32(2017) 419-427.
Download: pdf
[144]. Gyula O.H. Katona, Daniel T. Nagy, Union-intersecting set systems, Graphs and Combinatorics, 31(2015) 1507-1516.
Download: pdf
[145]. Gyula O.H. Katona, Around the Complete Intersection Theorem, Discrete Applied Mathematics 216(3)(2017) 618-621. (Special Volume: Levon Khachatrian's legacy in extremal combinatorics, edited by Zoltán Füredi and Gyula O.H. Katona)
Download: pdf
[146]. Gyula O.H. Katona, Some novelties on intersecting families of subsets, accepted in Matemática Contenporanea -- LAWCG 2018.
Download: pdf
[147]. Gyula O.H. Katona, A general two-part Erdős-Ko-Rado theorem, Opuscula Mathematica, 37(4)(2017) 577-588.
Download: pdf
[148]. Morteza Faghani, Gyula O.H. Katona, Results on the Wiener profile, AKCE International Journal of Graph and Combinatorics, 15(2018) 53-62.
Download: pdf
[149]. Gyula O.H. Katona, Results on intersecting families of subsets, a survey Proceeedings of the 3rd International Congress in Algebras and Combinatorics (ICAC 2017), World Scientific, accepted (2019) .
Download: pdf
[150]. Leila Badakhshian, Gyula O.H. Katona, Zsolt Tuza, The domination number of the graph defined by two levels of the n-cube, Discrete Applied Mathematics, 266(2019) 30-37.
Download: pdf
[151]. Gyula O.H. Katona, New results on intersecting families of subsets, Indian Journal of Discrete Mathematics (Proc. of the International Conference on Discrete Mathematics, 2018, Salem, Tamil Nadu, India) accepted.
Download: pdf
[152]. Chuanqi Xiao, Gyula O.H. Katona, Oscar Zamora and Jimeng Xiao, The Turán number of the square of a path, submitted.
Download: pdf
[153]. Gyula O.H. Katona and Jimeng Xiao, Largest family without a pair of posets on consecutive levels of the Boolean lattice, Order, DOI 10.1007/s11083-021-09558-3.
Download: pdf
[154]. Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener, Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets, Discrete Applied Math., 288(2021) 235-245.
Download: pdf
[155]. József Balogh, Gyula O.H. Katona, William Linz and Zsolt Tuza, The domination number of the graph defined by two levels of the n-cube, II. European J. Combinatorics 91(2021) 103201.
Download: pdf
[156]. Chuanqi Xiao, Gyula O.H. Katona, The number of triangles is more when they have no common vertex . Discrete Mathematics, 344(2021) 112330.
Download: pdf
[157]. Peter Frankl and Gyula O.H. Katona, On strengthenings of the intersecting shadow theorem, J. Combin. Theory A 184(2021) 105510
Download: pdf
[158].
M. Arató, Gy. O. H. Katona, Gy. Michaletzky, T. F. Móri, J. Pintz, T. Rudas, G. J. Székely and G. Tusnády,
Download:
pdf