Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 236 for “"Matchings"”.
-
Perfect matchings: Modified Aztec diamonds, covering graphs andn-matchings
… and we explore the structure of the perfect matchings of modified Aztec diamonds. We show that some of these matchings can be extended to matchings of the dual Aztec diamond, pointing out a bijection between these types of matchings. We determine the number of perfect matchings for each of …
-
Matchings and Representation Theory
… we investigate the algebraic properties of matchings via representation theory. We identify three scenarios in different areas of combinatorial mathematics where the algebraic structure of matchings gives keen insight into the combinatorial problem at hand. In particular, we prove tight …
-
Properties of Stable Matchings
Stable matchings were introduced in 1962 by David Gale and Lloyd Shapley to study the college admissions problem. The seminal work of Gale and Shapley has motivated hundreds of research papers and found applications in many areas of mathematics, computer science, economics, and even medicine. This …
-
Matchings in Geometric Graphs
… problem is to pack as many edge-disjoint perfect matchings as possible into a geometric graph. We study these problems and establish lower and upper bounds on the size of different kinds of matchings in various geometric graphs. We also present algorithms for computing such matchings. Some of the …
-
Matchings with a size constraint
We study the matching problem and some variants such as b-matching and (g, f)-factors. This thesis aims at polynomial algorithms which in addition have other properties. In particular, we develop a polynomial algorithm which can find optimal solutions of each possible size for weighted matching …
-
Matchings and Covers in Hypergraphs
… every $3$-uniform, tripartite hypergraph has two matchings which interact with each other in a very restricted way. However, the remainder of the proof uses only elementary methods to show how the extremal hypergraphs are built around these two matchings. Our second motivational pillar is Tuza's …
-
Matchings and games on networks
… standing open problem about cyclic 3D stable matchings. In particular, we prove that deciding whether a fixed 2D perfect matching can be extended to a 3D stable matching is NP-complete. In chapter 5 we study a long standing open problem of whether the nucleolus of matching games can be …
-
Minimal matchings from height functions
… explicit construction for minimal almost perfect matchings via height functions on plabic graphs corresponding to seeds of cluster algebras coming from the Grassmannian and lower-dimensional open positroid cells. In achieving such a construction, we have a road map for generating the set of all …
-
Minimal matchings from height functions
… explicit construction for minimal almost perfect matchings via height functions on plabic graphs corresponding to seeds of cluster algebras coming from the Grassmannian and lower-dimensional open positroid cells. In achieving such a construction, we have a road map for generating the set of all …
-
Essays on matchings and contests
This thesis is composed of two parts. Part I contributes to the matching literature and Part II contributes to the contest literature. Part I: A set of indivisible objects must be allocated among a group of agents, or agents from one side of the market must be matched to agents on the other. Each …
-
Matchings and Flows in Hypergraphs
In this dissertation, we study matchings and flows in hypergraphs using combinatorial methods. These two problems are among the best studied in the field of combinatorial optimization. As hypergraphs are a very general concept, not many results on graphs can be generalized to arbitrary hypergraphs. …
-
Matchings and coverings for graphs
Thesis (Ph.D.)--Michigan State University. Department of Mathematics, 1974
-
Musings on matchings, matrices, and multiplicities
The Parter-Wiener Theorem is a celebrated contribution to the inverse eigenvalue problem for trees due to its determination of vertices whose removal affects multiplicities of eigenvalues in a non-intuitive manner. For a more general graph, G, that contains cycles, the construction of the weighted …
-
On matchings and factors of graphs /
In Section 1, we recall the historical sketch of matching and factor theory of graphs, and also introduce some necessary definitions and notation. In Section 2, we present a sufficient condition for the existence of a (g, f)-factor in graphs with the odd-cycle property, which is simpler than that …
-
Sampling and Counting Crossing-Free Matchings
… count and almost uniformly sample crossing-free matchings for certain input classes of graphs. Since the problem in its generality appears to be difficult, we made natural restrictions on the in- put graphs. Namely, we consider vertices arranged in a grid in the plane, where edges are line …
-
Extendability of Graphs with Perfect Matchings
Ταίριασμα ενός γραφήματος είναι ένα σύνολο ακμών οι οποίες δεν έχουν κανένα κοινό άκρο και λέγεται τέλειο εάν κάθε κορυφή του γραφήματος προσπίτει σε κάποια ακμή του ταιριάσματος. Σκοπός της διπλωματικής είναι η μελέτη αλγοριθμικών και δομικών ιδιοτήτων γραφημάτων με τέλεια ταιριάσματα. …
-
Circuits, Perfect Matchings and Paths in Graphs
We primarily consider the problem of finding a family of circuits to cover a bidgeless graph (mainly on cubic graph) with respect to a given weight function defined on the edge set. The first chapter of this thesis is going to cover all basic concepts and notations will be used and a survey of this …
Page 1 of 12