Gyula O. H. Katona

Jimeng Xiao

Order, 2022

The Turán number of the square of a path.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

A generalization of the independence number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On strengthenings of the intersecting shadow theorem.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2021

The domination number of the graph defined by two levels of the n-cube, II.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

The number of triangles is more when they have no common vertex.

[BibT_eX]

[DOI]

Chuanqi Xiao

Discret. Math., 2021

Adaptive majority problems for restricted query graphs and for weighted sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Preface: 2nd Russian-Hungarian Combinatorial Workshop.

[BibT_eX]

[DOI]

Andrei M. Raigorodskii

Máté Vizer

Discret. Appl. Math., 2020

2019

The domination number of the graph defined by two levels of the n-cube.

[BibT_eX]

[DOI]

Leila Badakhshian

Zsolt Tuza

Discret. Appl. Math., 2019

2018

Results on the Wiener profile.

[BibT_eX]

[DOI]

Morteza Faghani

AKCE Int. J. Graphs Comb., 2018

2017

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Around the Complete Intersection Theorem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Preface: Levon Khachatrian's legacy in extremal combinatorics.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2015

Incomparable Copies of a Poset in the Boolean Lattice.

[BibT_eX]

[DOI]

Dániel T. Nagy

Order, 2015

Union-Intersecting Set Systems.

[BibT_eX]

[DOI]

Dániel T. Nagy

Graphs Comb., 2015

2014

A coding problem for pairs of subsets.

[BibT_eX]

[DOI]

Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013

Two-colorings with many monochromatic cliques in both colors.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2013

Color the cycles.

[BibT_eX]

[DOI]

Zsolt Tuza

Discret. Math., 2013

Sperner type theorems with excluded subposets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Majority and plurality problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Search When the Lie Depends on the Target.

[BibT_eX]

[DOI]

Krisztián Tichler

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Memories on Shadows and Shadows of Memories.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Erdös-Ko-Rado from intersecting shadows.

[BibT_eX]

[DOI]

Ákos Kisvölcsey

Discuss. Math. Graph Theory, 2012

Minimum average-case queries of q+1-ary search game with small sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Most Probably Intersecting Families of Subsets.

[BibT_eX]

[DOI]

Gyula Y. Katona

Zsolt Katona

Comb. Probab. Comput., 2012

On the distance of databases.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2012

Encoding Databases Satisfying a Given Set of Dependencies.

[BibT_eX]

[DOI]

Krisztián Tichler

Proceedings of the Foundations of Information and Knowledge Systems, 2012

Random Databases with Correlated Data.

[BibT_eX]

[DOI]

Proceedings of the Conceptual Modelling and Its Theoretical Foundations, 2012

2010

On the Distance of Databases.

[BibT_eX]

[DOI]

Anita Keszler

Proceedings of the Foundations of Information and Knowledge Systems, 2010

2008

Bounds on Maximal Families of Sets Not Containing Three Sets with A INTERSECTION B SUBSET OF C , A NOT A SUBSET OF B.

[BibT_eX]

[DOI]

Teena Carroll

Order, 2008

No four subsets forming an N.

[BibT_eX]

[DOI]

Jerrold R. Griggs

J. Comb. Theory, Ser. A, 2008

Functional dependencies distorted by errors.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Random Geometric Identification.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2008

2007

Largest Families Without an r -Fork.

[BibT_eX]

[DOI]

Annalisa De Bonis

Order, 2007

2006

Forbidden inclusion patterns in families of subsets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2-Bases of Quadruples.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

On the security of individual data.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2006

Some Contributions to the Minimum Representation Problem of Key Systems.

[BibT_eX]

[DOI]

Krisztián Tichler

Proceedings of the Foundations of Information and Knowledge Systems, 2006

On the Number of Independent Functional Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2006

2005

Two-Part and k-Sperner Families: New Proofs Using Permutations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Largest family without A union B subset of C intersection D.

[BibT_eX]

[DOI]

Annalisa De Bonis

Konrad J. Swanepoel

J. Comb. Theory, Ser. A, 2005

Preface.

[BibT_eX]

[DOI]

Jin Ho Kwak

Dan Archdeacon

Discret. Math., 2005

Constructions via Hamiltonian Theorems.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

New type of coding problem motivated by database theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Strong qualitative independence.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

A coding problem for pairs of subsets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

2002

On the average size of sets in intersecting Sperner families.

[BibT_eX]

[DOI]

Discret. Math., 2002

Functional Dependencies in Presence of Errors.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2002

2001

Intersecting Balanced Families of Sets.

[BibT_eX]

[DOI]

Adam Idzik

Rajiv Vohra

J. Comb. Theory, Ser. A, 2001

Pairs of Disjoint q-element Subsets Far from Each Other.

[BibT_eX]

[DOI]

Hikoe Enomoto

Electron. J. Comb., 2001

Semantics in Databases.

[BibT_eX]

[DOI]

Proceedings of the Semantics in Databases, 2001

2000

Error-Correcting Keys in Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2000

Low Discrepancy Allocation of Two-Dimensional Data.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2000

1998

Asymptotic Properties of Keys and Functional Dependencies in Random Databases.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

A Simple Proof of a Theorem of Milner.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1998

1997

Extremal problems for finite sets and convex hulls - A survey.

[BibT_eX]

[DOI]

Discret. Math., 1997

1996

Preface.

[BibT_eX]

[DOI]

András Hajnal

Discret. Math., 1996

1995

The Average Length of Keys and Functional Dependencies in (Random) Databases.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 1995

1993

Optimization of the reliability polynomial in presence of mediocre elements.

[BibT_eX]

[DOI]

Wojbor A. Woyczynski

Networks, 1993

Greedy Construction of Nearly Regular Graphs.

[BibT_eX]

[DOI]

Ákos Seress

Eur. J. Comb., 1993

The largest component in a random subgraph of the n-cycle.

[BibT_eX]

[DOI]

Louis V. Quintas

Discret. Math., 1993

A Survey of Some Combinatorial Results Concerning Functional Dependencies in Database Relations.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1993

1992

The Characterization of Branching Dependencies.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Partial Dependencies in Relational Databases and their Realization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Combinatorial and Algebraic Results for Database Relations.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 1992

1991

On the Number of Databases and Closure Operations.

[BibT_eX]

[DOI]

Alexander A. Sapozhenko

Theor. Comput. Sci., 1991

1987

Extremal Combinatorial Problems of Database Models.

[BibT_eX]

[DOI]

Proceedings of the MFDBS 87, 1987

1986

All maximum 2-part Sperner families.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1986

Convex hulls of more-part Sperner families.

[BibT_eX]

[DOI]

Graphs Comb., 1986

1985

Polytopes Determined by Hypergraph Classes.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

Minimum matrix representation of closure operations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1985

Extremal hypergraph problems and convex hulls.

[BibT_eX]

[DOI]

Comb., 1985

1984

Intersecting Sperner families and their convex hulls.

[BibT_eX]

[DOI]

Comb., 1984

1981

Sums of Vectors and Turán's Problem for 3-graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

Extremal Combinatorial Problems in Relational Data Base.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

On the number of maximal dependencies in a data base relation of fixed order.

[BibT_eX]

[DOI]

Discret. Math., 1980

1979

Obituary.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1979

1977

Contributions to the geometry of hamming spaces.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Discret. Math., 1977

1976

Huffman codes and self-information.

[BibT_eX]

[DOI]

Tibor O. H. Nemetz

IEEE Trans. Inf. Theory, 1976

1974

Solution of a Problem of A. Ehrenfeucht and J. Mycielski.

[BibT_eX]

[DOI]