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 6 of 6 for “"uniform matroid"”.
-
Exponentially Dense Matroids
… relating to the maximum density of rank-n matroids in a minor-closed class. Consider a minor-closed class M of matroids that does not contain a given rank-2 uniform matroid. The growth rate function is defined by h_M(n) = max(|N| : N ∈ M simple, r(N) ≤ n). The Growth Rate Theorem, due to …
-
Matroids with large branch-depth
We prove a conjecture of DeVos, Kwon and Oum that matroids of high branch-depth have large uniform minors or large fan minors. The groundset of a large matroid of low branchdepth admits a partition into many sets such that the union of any subcollection has low connectivity. Most of the work in …
-
Quadratically Dense Matroids
… with finding the maximum density of rank-$n$ matroids in a minor-closed class. The extremal function of a non-empty minor-closed class $\mathcal M$ of matroids which excludes a rank-2 uniform matroid is defined by $$h_{\mathcal M}(n)=\max(|M|\colon M\in \mathcal M \text{ is simple, and } …
-
On the Matroid Intersection Conjecture
In this dissertation, we investigate the Matroid Intersection Conjecture for pairs of matroids on the same ground set, proposed by Nash-Williams in 1990. Originally, the conjecture was stated for finitary matroids only, but we consider it for general matroids and introduce new approaches to attack …
-
Efficient Image Ranking in Heterogeneous Social Media Networks
… a novel yet efficient framework, based on non-uniform matroid constraints, to jointly capture the relevance and diversity. Finally, we study the problem of landmark photo retrieval over social media networks. Observing that a landmark query issued by a specific user cannot generally display …
-
A Dual Fano, and Dual Non-Fano Matroidal Network
<p>Matroidal networks are useful tools in furthering research in network coding. They have been used to show the limitations of linear coding solutions. In this paper we examine the basic information on network coding and matroid theory. We then go over the method of creating matroidal networks. …