# Browse Dissertations and Theses - Mathematics by Contributor "Balogh, József"

• (2012-05-22)
In this thesis we study some extremal problems related to colorings and list colorings of graphs and hypergraphs. One of the main problems that we study is: What is the minimum number of edges in an $r$-uniform hypergraph ...

application/pdf

PDF (502kB)
• (2011-08-26)
In this thesis we consider several extremal problems for graphs and hypergraphs: packing, domination, and coloring. Graph packing problems have many applications to areas such as scheduling and partitioning. We consider a ...

application/pdf

PDF (853kB)
• (2012-09-18)
We examine several problems in extremal graph theory, emphasizing problems involving games on graphs. In Chapter 2, we study a variant of Ramsey theory, seeking Ramsey hosts with small maximum degree. We focus on finding ...

application/pdf

PDF (895kB)
• (2016-07-14)
In this dissertation, we will focus on a few problems in extremal graph theory. The first chapter consists of some basic terms and tools. In Chapter 2, we study a conjecture of Mader on embedding subdivisions of cliques. ...

application/pdf

PDF (702kB)
• (2014-09-16)
We study problems in extremal combinatorics motivated by Turan's Theorem and Ramsey Theory. In Chapter 2, we use Flag Algebras to study these problems. With Balogh, Lidicky, Pikhurko, Udvari and Volec, we gave the exact ...

application/pdf

PDF (911kB)
• (2011-05-25)
This dissertation investigates several questions in extremal graph theory and the theory of graph minors. It consists of three independent parts; the first two parts focus on questions motivated by Turan's Theorem and ...

application/pdf

PDF (711kB)
• (2010-05-14)
This dissertation tackles several questions in extremal graph theory and the theory of random graphs. It consists of three more or less independent parts that all fit into one bigger picture -- the meta-problem of describing ...

application/pdf

PDF (912kB)
• (2011-08-25)
In this thesis, we study extremal problems concerning cycles and paths in graphs, graph packing, and graph decomposition. We use “graph” in the general sense, allowing loops and multi-edges. The Chv´atal–Erd˝os Theorem ...

application/pdf

PDF (362kB)
• (2012-09-18)
We study problems in extremal combinatorics with respect to forbidden induced subgraphs, forbidden colored subgraphs, and forbidden subgraphs. In Chapter 2, we determine exactly which graphs H have the property that ...

application/pdf

PDF (603kB)
• (2013-05-24)
In this thesis, we study extremal problems about vertex degrees and a variant of Ramsey number of graphs, and also structural problems about graph decomposition. In a list (d_1,...,d_n) of positive integers, let r and ...

application/pdf

PDF (479kB)
• (2012-02-01)
We consider a variety of problems in extremal graph and set theory. Given a property $\Gamma$ and a family of sets ${\mathcal F}$, let $f({\mathcal F},\Gamma)$ be the size of the largest subfamily of ${\mathcal F}$ ...

application/pdf

PDF (531kB)
• (2017-04-05)
A classical problem in combinatorics is, given graphs G and H, to determine if H is a subgraph of G. It is usually computationally complex to determine if H is a subgraph of G. Therefore, we often prove conditions that ...

application/pdf

PDF (942kB)