Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Problems In Extremal Graph Theory, Kamil Popielarz
Problems In Extremal Graph Theory, Kamil Popielarz
Electronic Theses and Dissertations
This dissertation consists of six chapters concerning a variety of topics in extremal graph theory.Chapter 1 is dedicated to the results in the papers with Antnio Giro, Gbor Mszros, and Richard Snyder. We say that a graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in eachpair. We study the extremal behavior of maximum degree and diameter in some classes of path-pairable graphs. In particular we show that a path-pairable planar graph must have a vertex of linear degree.In Chapter 2 we present a joint work with Antnio Giro and Teeradej …
On The Structure Of Dense Graphs, And Other Extremal Problems, Richard Snyder
On The Structure Of Dense Graphs, And Other Extremal Problems, Richard Snyder
Electronic Theses and Dissertations
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, …