Browse Dissertations and Theses - Mathematics by Contributor "Balogh, Jozsef"

  • Bernshteyn, Anton (2018-05-02)
    In this dissertation we study problems related to colorings of combinatorial structures both in the “classical” finite context and in the framework of descriptive set theory, with applications to topological dynamics and ...

    application/pdf

    application/pdfPDF (1MB)
  • Liu, Hong (2015-12-04)
    In this thesis, we study supersaturation and enumeration problems in extremal combinatorics. In Chapter 2, with Balogh, we disprove a conjecture of Erdos and Tuza concerning the number of different ways one can create a ...

    application/pdf

    application/pdfPDF (649kB)
  • Yeager, Elyse Christine (2015-04-23)
    In this thesis, we tackle two main themes: sufficient conditions for the existence of particular subgraphs in a graph, and variations on graph saturation. Determining whether a graph contains a certain subgraph is a ...

    application/pdf

    application/pdfPDF (1MB)
  • Petrickova, Sarka (2017-04-19)
    The fast developing field of extremal combinatorics provides a diverse spectrum of powerful tools with many applications to economics, computer science, and optimization theory. In this thesis, we focus on counting and ...

    application/pdf

    application/pdfPDF (984kB)
  • Wagner, Zsolt Adam (2018-04-11)
    This is a study of a small selection of problems from various areas of Combinatorics and Graph Theory, a fast developing field that provides a diverse spectrum of powerful tools with numerous applications to computer ...

    application/pdf

    application/pdfPDF (777kB)
  • Yancey, Matthew (2013-05-24)
    This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in edge-colored graphs. A graph $G$ is $k$-{\em critical} if $G$ is not $(k-1)$-colorable, but every proper subgraph of $G$ ...

    application/pdf

    application/pdfPDF (894kB)
  • Delcourt, Michelle Jeannette (2017-03-27)
    This thesis focuses on using techniques from probability to solve problems from extremal and structural combinatorics. The main problem in Chapter 2 is determining the typical structure of $t$-intersecting families in ...

    application/pdf

    application/pdfPDF (741kB)Restricted to U of Illinois