9 research outputs found
Extremal families for the Kruskal--Katona theorem
Given a family of --subsets of , its lower shadow is
the family of --subsets which are contained in at least one set in .
The celebrated Kruskal--Katona theorem gives the minimum cardinality of
in terms of the cardinality of . F\"uredi and Griggs (and
M\"ors) showed that the extremal families for this shadow minimization problem
in the Boolean lattice are unique for some cardinalities and asked for a
general characterization of these extremal families.
In this paper we prove a new combinatorial inequality from which yet another
simple proof of the Kruskal--Katona theorem can be derived. The inequality can
be used to obtain a characterization of the extremal families for this
minimization problem, giving an answer to the question of F\"uredi and Griggs.
Some known and new additional properties of extremal families can also be
easily derived from the inequality
On the structure of dense graphs, and other extremal problems
Extremal combinatorics is an area of mathematics populated by problems that are easy to state, yet often difficult to resolve. The typical question in this field is the following: What is the maximum or minimum size of a collection of finite objects (e.g., graphs, finite families of sets) subject to some set of constraints? Despite its apparent simplicity, this question has led to a rather rich body of work. This dissertation consists of several new results in this field.The first two chapters concern structural results for dense graphs, thus justifying the first part of my title. In the first chapter, we prove a stability result for edge-maximal graphs without complete subgraphs of fixed size, answering questions of Tyomkyn and Uzzell. The contents of this chapter are based on joint work with Kamil Popielarz and Julian Sahasrabudhe.The second chapter is about the interplay between minimum degree and chromatic number in graphs which forbid a specific set of `small\u27 graphs as subgraphs. We determine the structure of dense graphs which forbid triangles and cycles of length five. A particular consequence of our work is that such graphs are 3-colorable. This answers questions of Messuti and Schacht, and Oberkampf and Schacht. This chapter is based on joint work with Shoham Letzter.Chapter 3 departs from undirected graphs and enters the domain of directed graphs. Specifically, we address the connection between connectivity and linkedness in tournaments with large minimum out-degree. Making progress on a conjecture of Pokrovskiy, we show that, for any positive integer , any -connected tournament with large enough minimum out-degree is -linked. This chapter is based on joint work with Ant{\\u27o}nio Gir{\~a}o.ArrayThe final chapter leaves the world of graphs entirely and examines a problem in finite set systems.More precisely, we examine an extremal problem on a family of finite sets involving constraints on the possible intersectionsizes these sets may have. Such problems have a long history in extremal combinatorics. In this chapter, we are interested in the maximum number of disjoint pairs a family of sets can have under various restrictions on intersection sizes. We obtain several new results in this direction. The contents of this chapter are based on joint work with Ant{\\u27o}nio Gir{\~a}o
Isoperimetric problems for r-sets
The Edge isoperimetric inequalities for r-sets was analyzed. A set in the form of a k-ball was discussed. It was observed that to minimize the lower shadow initial segents of the colex order should be taken, and for the upper shadow to be minimized initial segments of the lex order should be taken. It was found that to minimize the number of q-sets at hamming distance from one family it was best to take some balls