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 186 for “"Matroids."”.

  1. Hypergraphic matroids

    … a matroid on the edge-set of a graph; the matroids so defined are called "hypergraphic matroids". Analogues are found in hypergraphs of the concepts of trees, forests, circuits, cutsets and components; we show that two generalisations are necessary of the concept of a vertex in a graph - a …

    the-open-u Download PDF for Hypergraphic matroids (opens in a new tab)

  2. 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 …

    waterloo Repository record for Exponentially Dense Matroids (opens in a new tab)

  3. 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 } …

    waterloo Repository record for Quadratically Dense Matroids (opens in a new tab)

  4. Matroids and complexity

    … basis graphs to parameters of their associated matroids. For small values of k we determine which matroids have the clique number, chromatic number, or maximum degree of their basis graphs bounded above by k. If P is a class of graphs that is closed under isomorphism and induced subgraphs, then …

    oxford Repository record for Matroids and complexity (opens in a new tab)

  5. Tutte-Equivalent Matroids

    We begin by introducing matroids in the context of finite collections of vectors from a vector space over a specified field, where the notion of independence is linear independence. Then we will introduce the concept of a matroid invariant. Specifically, we will look at the Tutte polynomial, which …

    csusb Repository record for Tutte-Equivalent Matroids (opens in a new tab)

  6. Regular Round Matroids

    … means for subsets of E to be independent. Some matroids, called regular matroids, have the property that all elements in their ground set can be represented by vectors over any field. A matroid is called round if its dual has no two disjoint minimal dependent sets. Roundness is an important …

    csusb Repository record for Regular Round Matroids (opens in a new tab)

  7. Representations of matroids

    The concept of matroids was originally introduced by Whitney and Van der Waerden in the 1930's to generalise the notion of linear dependence in a vector space; certain axioms satisfied by this relation were observed to be satisfied by other types of ’ dependence’ relations, such as algebraic …

    whiterose Download PDF for Representations of matroids (opens in a new tab)

  8. Characteristic Sets of Matroids

    <p>Matroids are combinatorial structures that generalize the properties of linear independence. But not all matroids have linear representations. Furthermore, the existence of linear representations depends on the characteristic of the fields, and the linear characteristic set is the set of …

    utk-theses Repository record for Characteristic Sets of Matroids (opens in a new tab)

  9. Cocircuits of vector matroids

    … of the network. I provide an introduction to matroids, and their relation to the degree of redundancy problem. I also discuss existing methods developed to solve the matroid cogirth problem and the SCP. Computational results are provided to validate a branch-and-cut algorithm that addresses …

    rice Repository record for Cocircuits of vector matroids (opens in a new tab)

  10. Templates for Representable Matroids

    … connected member of a minor-closed class of matroids representable over a finite field is a mild modification (known as a perturbation) of a frame matroid, the dual of a frame matroid, or a matroid representable over a proper subfield. They introduced the notion of a template to describe …

    lsu-thes Repository record for Templates for Representable Matroids (opens in a new tab)

  11. DVR-Matroids of Algebraic Extensions

    … satisfy certain conditions. The most well-known matroids are linear matroids, which come from a finite subset of a vector space over a field K. In this case the independent sets are the subsets that are linearly independent over K. Algebraic matroids come from a finite set of elements in an …

    utk-theses Repository record for DVR-Matroids of Algebraic Extensions (opens in a new tab)

  12. Negative Correlation Properties for Matroids

    … on certain negative correlation properties in matroids. In particular, the results presented contribute to the search for matroids which satisfy $$P(\{X:e,f\in X\}) \leq P(\{X:e\in X\})P(\{X:f\in X\})$$ for certain measures, $P$, on the ground set. Let $\mathcal M$ be a matroid. Let $(y_g:g\in …

    waterloo Repository record for Negative Correlation Properties for Matroids (opens in a new tab)

  13. 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 …

    waterloo Repository record for Matroids with large branch-depth (opens in a new tab)

  14. Clique minors in dense matroids

    The objective of this thesis is to bound the number of points a $U_{2,\ell+2}$- and $M(K_{k+1})$-minor-free matroid has. We first prove that a sufficiently large matroid will contain a structure called a tower. We then use towers to find a complete minor in a matroid with no $U_{2,\ell+2}$-minor.

    waterloo Repository record for Clique minors in dense matroids (opens in a new tab)

  15. Modularity and Structure in Matroids

    … generalized this from M(K_4) to larger frame matroids, showing that any vertically 5-connected, representable matroid with a rank-4 Dowling geometry as a modular restriction is a frame matroid. As with projective geometries, we prove a version of this result for matroids with large Dowling …

    waterloo Repository record for Modularity and Structure in Matroids (opens in a new tab)

  16. Infinite Matroids and Transfinite Sequences

    … introduced µ- admissibility for pairs of matroids on the same ground set and showed that it is a necessary condition for the existence of a matching. A pair of matroids (M,W) with common ground set E is µ-admissible if a subset of sequences in E × {0,1} have a certain property. In order to …

    wvu Repository record for Infinite Matroids and Transfinite Sequences (opens in a new tab)

Page 1 of 10