Gyula O. H. Katona - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 86 from 86

2025

Forbidden Subposets in the Cycle PosetAysan Behnia, Gholam Hossein Fath-Tabar, Gyula O. H. Katona. order, 42(1):241-250, April 2025. [doi]

k-element subsetsJoanna Jasinska, Gyula O. H. Katona. dmgt, 45(3):1081-1089, 2025. [doi]

2024

Extremal graphs without long paths and large cliquesGyula O. H. Katona, Chuanqi Xiao. ejc, 119:103807, 2024. [doi]

Study on Using Reinforcement Learning for the Monotone Boolean ReconstructionHasmik Sahakyan, Gyula O. H. Katona, Levon Aslanyan. informaticaSI, 48(4), 2024. [doi]

2022

A generalization of the independence numberGyula O. H. Katona. DAM, 321:1-3, 2022. [doi]

Largest Family Without a Pair of Posets on Consecutive Levels of the Boolean LatticeGyula O. H. Katona, Jimeng Xiao. order, 39(1):15-27, 2022. [doi]

The Turán number of the square of a pathChuanqi Xiao, Gyula O. H. Katona, Jimeng Xiao, Oscar Zamora. DAM, 307:1-14, 2022. [doi]

2021

The domination number of the graph defined by two levels of the n-cube, IIJózsef Balogh, Gyula O. H. Katona, William Linz, Zsolt Tuza. ejc, 91:103201, 2021. [doi]

Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein"Alexander Barg, Lara Dolecek, Ryan Gabrys, Gyula O. H. Katona, János Körner, Andrew McGregor 0001, Olgica Milenkovic, Sihem Mesnager, Gilles Zémor. TIT, 67(6):3187-3189, 2021. [doi]

Adaptive majority problems for restricted query graphs and for weighted setsGá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. DAM, 288:235-245, 2021. [doi]

On strengthenings of the intersecting shadow theoremPeter Frankl, Gyula O. H. Katona. jcta, 184:105510, 2021. [doi]

The number of triangles is more when they have no common vertexChuanqi Xiao, Gyula O. H. Katona. DM, 344(5):112330, 2021. [doi]

2020

Preface: 2nd Russian-Hungarian Combinatorial WorkshopGyula O. H. Katona, Andrei M. Raigorodskii, Máté Vizer. DAM, 276:1, 2020. [doi]

2019

The domination number of the graph defined by two levels of the n-cubeLeila Badakhshian, Gyula O. H. Katona, Zsolt Tuza. DAM, 266:30-37, 2019. [doi]

2018

Results on the Wiener profileMorteza Faghani, Gyula O. H. Katona. akcej, 15(1):53-62, 2018. [doi]

2017

Preface: Levon Khachatrian's legacy in extremal combinatoricsZoltán Füredi, Gyula O. H. Katona. DAM, 216:483-488, 2017. [doi]

Around the Complete Intersection TheoremGyula O. H. Katona. DAM, 216:618-621, 2017. [doi]

PrefaceDeepa Sinha, Thomas Zaslavsky, Gyula O. H. Katona, Tao-Ming Wang. endm, 63:1-2, 2017. [doi]

2015

Union-Intersecting Set SystemsGyula O. H. Katona, Dániel T. Nagy. gc, 31(5):1507-1516, 2015. [doi]

Incomparable Copies of a Poset in the Boolean LatticeGyula O. H. Katona, Dániel T. Nagy. order, 32(3):419-427, 2015. [doi]

2014

A coding problem for pairs of subsetsBéla Bollobás, Zoltán Füredi, Ida Kantor, Gyula O. H. Katona, Imre Leader. In Jirí Matousek, Jaroslav Nesetril, Marco Pellegrini, editors, Geometry, Structure and Randomness in Combinatorics. Volume 18 of Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series, pages 47-59, Springer, 2014. [doi]

2013

Two-colorings with many monochromatic cliques in both colorsPeter Frankl, Mitsuo Kato, Gyula O. H. Katona, Norihide Tokushige. JCT, 103(4):415-427, 2013. [doi]

Majority and plurality problemsDániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós. DAM, 161(6):813-818, 2013. [doi]

Search When the Lie Depends on the TargetGyula O. H. Katona, Krisztián Tichler. BIRTHDAY 2013: 648-657 [doi]

Sperner type theorems with excluded subposetsGyula O. H. Katona. DAM, 161(9):1251-1258, 2013. [doi]

Memories on Shadows and Shadows of MemoriesGyula O. H. Katona. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 195-198, Springer, 2013. [doi]

Color the cyclesGyula O. H. Katona, Zsolt Tuza. DM, 313(19):2026-2033, 2013. [doi]

2012

Random Databases with Correlated DataGyula O. H. Katona. BIRTHDAY 2012: 29-35 [doi]

Encoding Databases Satisfying a Given Set of DependenciesGyula O. H. Katona, Krisztián Tichler. foiks 2012: 203-223 [doi]

Most Probably Intersecting Families of SubsetsGyula O. H. Katona, Gyula Y. Katona, Zsolt Katona. cpc, 21(1-2):219-227, 2012. [doi]

Erdös-Ko-Rado from intersecting shadowsGyula O. H. Katona, Ákos Kisvölcsey. dmgt, 32(2):379-382, 2012. [doi]

On the distance of databasesGyula O. H. Katona, Attila Sali. AMAI, 65(2-3):199-216, 2012. [doi]

Minimum average-case queries of q+1-ary search game with small setsKun Meng, Chuang Lin, Wen An Liu, Yang Yang, Gyula O. H. Katona. DAM, 160(4-5):618-627, 2012. [doi]

2010

On the Distance of DatabasesGyula O. H. Katona, Anita Keszler, Attila Sali. foiks 2010: 76-93 [doi]

2008

2007

Largest Families Without an ::::r:::: -ForkAnnalisa De Bonis, Gyula O. H. Katona. order, 24(3):181-191, 2007. [doi]

2006

2005

Largest family without ::::A:::: union ::::B:::: subset of ::::C:::: intersection ::::D::::Annalisa De Bonis, Gyula O. H. Katona, Konrad J. Swanepoel. JCT, 111(2):331-336, 2005. [doi]

Two-Part and ::::k::::-Sperner Families: New Proofs Using PermutationsPéter L. Erdös, Zoltán Füredi, Gyula O. H. Katona. siamdm, 19(2):489-500, 2005. [doi]

Constructions via Hamiltonian TheoremsGyula O. H. Katona. DM, 303(1-3):87-103, 2005. [doi]

PrefaceJin Ho Kwak, Gyula O. H. Katona, Dan Archdeacon. DM, 303(1-3):1, 2005. [doi]

2004

On the Security of Individual DataJános Demetrovics, Gyula O. H. Katona, Dezsö Miklós. foiks 2004: 49-58 [doi]

Strong qualitative independenceGyula O. H. Katona. DAM, 137(1):87-95, 2004. [doi]

New type of coding problem motivated by database theoryGyula O. H. Katona, Attila Sali. DAM, 144(1-2):140-148, 2004. [doi]

2003

A coding problem for pairs of subsetsGyula O. H. Katona. endm, 15:233-236, 2003. [doi]

2002

On the average size of sets in intersecting Sperner familiesChristian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck. DM, 257(2-3):259-266, 2002. [doi]

Functional Dependencies in Presence of ErrorsJános Demetrovics, Gyula O. H. Katona, Dezsö Miklós. foiks 2002: 85-92 [doi]

2001

Semantics in DatabasesLeopoldo E. Bertossi, Gyula O. H. Katona, Klaus-Dieter Schewe, Bernhard Thalheim. sdb 2003: 1-6 [doi]

Pairs of Disjoint q-element Subsets Far from Each OtherHikoe Enomoto, Gyula O. H. Katona. combinatorics, 8(2), 2001. [doi]

Intersecting Balanced Families of SetsAdam Idzik, Gyula O. H. Katona, Rajiv Vohra. JCT, 93(2):281-291, 2001. [doi]

2000

Low Discrepancy Allocation of Two-Dimensional DataRichard P. Anstee, János Demetrovics, Gyula O. H. Katona, Attila Sali. foiks 2000: 1-12 [doi]

Error-Correcting Keys in Relational DatabasesJános Demetrovics, Gyula O. H. Katona, Dezsö Miklós. foiks 2000: 88-93 [doi]

1998

Asymptotic Properties of Keys and Functional Dependencies in Random DatabasesJános Demetrovics, Gyula O. H. Katona, Dezsö Miklós, Oleg Seleznjev, Bernhard Thalheim. TCS, 190(2):151-166, 1998. [doi]

A Simple Proof of a Theorem of MilnerGyula O. H. Katona. JCT, 83(1):138-140, 1998. [doi]

1997

Extremal problems for finite sets and convex hulls - A surveyGyula O. H. Katona. DM, 164(1-3):175-185, 1997. [doi]

1996

PrefaceAndrás Hajnal, Gyula O. H. Katona, Attila Sali. DM, 150(1-3):1, 1996. [doi]

1995

The Average Length of Keys and Functional Dependencies in (Random) DatabasesJános Demetrovics, Gyula O. H. Katona, Dezsö Miklós, Oleg Seleznjev, Bernhard Thalheim. icdt 1995: 266-279 [doi]

1993

A Survey of Some Combinatorial Results Concerning Functional Dependencies in Database RelationsJános Demetrovics, Gyula O. H. Katona. AMAI, 7(1-4):63-82, 1993.

The largest component in a random subgraph of the n-cycleGyula O. H. Katona, Louis V. Quintas. DM, 121(1-3):113-116, 1993. [doi]

Optimization of the reliability polynomial in presence of mediocre elementsGyula O. H. Katona, Wojbor A. Woyczynski. networks, 23(4):327-332, 1993. [doi]

Greedy Construction of Nearly Regular GraphsGyula O. H. Katona, Ákos Seress. ejc, 14(3):213-229, 1993. [doi]

1992

Partial Dependencies in Relational Databases and their RealizationJános Demetrovics, Gyula O. H. Katona, Dezsö Miklós. DAM, 40(2):127-138, 1992.

The Characterization of Branching DependenciesJános Demetrovics, Gyula O. H. Katona, Attila Sali. DAM, 40(2):139-153, 1992.

Combinatorial and Algebraic Results for Database RelationsGyula O. H. Katona. icdt 1992: 1-20 [doi]

1991

On the Number of Databases and Closure OperationsG. Burosch, János Demetrovics, Gyula O. H. Katona, Daniel J. Kleitman, Alexander A. Sapozhenko. TCS, 78(2):377-381, 1991.

1987

Extremal Combinatorial Problems of Database ModelsJános Demetrovics, Gyula O. H. Katona. mfdbs 1988: 99-127 [doi]

1986

All maximum 2-part Sperner familiesPéter L. Erdös, Gyula O. H. Katona. JCT, 43(1):58-69, 1986. [doi]

Convex hulls of more-part Sperner familiesPéter L. Erdös, Gyula O. H. Katona. gc, 2(1):123-134, 1986. [doi]

1985

Minimum matrix representation of closure operationsJános Demetrovics, Zoltán Füredi, Gyula O. H. Katona. DAM, 11(2):115-128, 1985. [doi]

Extremal hypergraph problems and convex hullsPéter L. Erdös, Peter Frankl, Gyula O. H. Katona. combinatorica, 5(1):11-26, 1985.

Polytopes Determined by Hypergraph ClassesPeter Frankl, Gyula O. H. Katona. ejc, 6(3):233-243, 1985. [doi]

1984

Intersecting Sperner families and their convex hullsPéter L. Erdös, Peter Frankl, Gyula O. H. Katona. combinatorica, 4(1):21-34, 1984.

1981

Extremal Combinatorial Problems in Relational Data BaseJános Demetrovics, Gyula O. H. Katona. fct 1981: 110-119

Sums of Vectors and Turán's Problem for 3-graphsGyula O. H. Katona. ejc, 2(2):145-154, 1981. [doi]

1980

On the number of maximal dependencies in a data base relation of fixed orderA. Békéssy, János Demetrovics, László Hannák, Peter Frankl, Gyula O. H. Katona. DM, 30(2):83-88, 1980. [doi]

1979

ObituaryGyula O. H. Katona. JCT, 26(3):275, 1979. [doi]

1977

Contributions to the geometry of hamming spacesRudolf Ahlswede, Gyula O. H. Katona. DM, 17(1):1-22, 1977. [doi]

1976

Huffman codes and self-informationGyula O. H. Katona, Tibor O. H. Nemetz. TIT, 22(3):337-340, 1976. [doi]

1974

Solution of a Problem of A. Ehrenfeucht and J. MycielskiGyula O. H. Katona. JCT, 17(2):265-266, 1974.

Sign in or sign up to see more results.

runs on WebDSL