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 23 for “"Excluded Minors"”.

  1. Excluded minors for nearly-paving matroids

    … whether or not M belongs to a given class. An excluded minor of a minor-closed class is a matroid N that is, in a sense, minimal with respect to not being in the minor-closed class. An attractive way to characterize a minor-closed class of matroids is to determine the complete list of excluded …

    csusb Repository record for Excluded minors for nearly-paving matroids (opens in a new tab)

  2. On the Excluded Minors for Dyadic Matroids

    … and $GF(5)$, is a natural step to finding the excluded minors for $GF(5)$-representability. In this thesis we characterize the ternary matroids $M$ that are excluded minors for dyadic matroids and contains a 3-separation. We will show that one side of the separation has size at most four, and …

    waterloo Repository record for On the Excluded Minors for Dyadic Matroids (opens in a new tab)

  3. On Excluded Minors for Even Cut Matroids

    In this thesis we will present two main theorems that can be used to study minor minimal non even cut matroids. Given any signed graph we can associate an even cut matroid. However, given an even cut matroid, there are in general, several signed graphs which represent that matroid. This is in …

    waterloo Repository record for On Excluded Minors for Even Cut Matroids (opens in a new tab)

  4. Counting cliques in graphs with excluded minors

    … extremal problems in graphs that exclude certain minors, focusing on the maximum number of k-cliques such graphs can contain. The first part of the thesis studies planar graphs, which forbid K5 and K3,3 as minors. We determine the maximum number of edges is in a planar graph that contains no cycle …

    gatech Repository record for Counting cliques in graphs with excluded minors (opens in a new tab)

  5. The search for an excluded minor characterization of ternary Rayleigh matroids

    … known if this class has a finite set of minimal excluded minors. At this time, it seems unlikely that this is the case. It has been shown that there is a single minimal excluded minor for the smaller class of binary Rayleigh matroids [5]. The aim of this thesis is to detail our search for the set …

    waterloo Repository record for The search for an excluded minor characterization of ternary Rayleigh matroids (opens in a new tab)

  6. Excluded-minor characterization of apex-outerplanar graphs

    … is minor-closed and can be characterized by two excluded minors: K_4 and K_{2,3}. The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed. We provide the complete list of 57 excluded minors for this class.

    lsu-thes Repository record for Excluded-minor characterization of apex-outerplanar graphs (opens in a new tab)

  7. Dissecting an integer polymatroid

    … of the independent set polytopes of the minors of ρ. To better understand the interior of this polytope, we endow a structure on this polytope which relates to the polymatroid operation of compression and the k-natural matroid of ρ. The latter can be intuited as follows: if we think of a …

    cornell Repository record for Dissecting an integer polymatroid (opens in a new tab)

  8. Refining the characterization of projective graphs

    … projective plane is characterized by a set of 35 excluded minors. Robertson, Seymour and Thomas in an unpublished result found the excluded minors for the class of k-connected graphs embeddable on the projective plane for k = 1,2,3. We give a short proof of that result and then determine the …

    lsu-thes Repository record for Refining the characterization of projective graphs (opens in a new tab)

  9. On k-level matroids: geometry and combinatorics

    … Theta rank or levelness is closed under taking minors. This allows us to find a characterization of matroids with bounded Theta rank or levelness in terms of forbidden minors. We give the complete (finite) list of excluded minors for Theta-1 matroids which generalize the well-known …

    fu-berlin Repository record for On k-level matroids: geometry and combinatorics (opens in a new tab)

  10. Exploring Matroid Minors

    … but have the property that each of their proper minors is in the class; that is, minor-minimal matroids that are not in the minor-closed class. These minor-minimal matroids that are not in the minor-closed class are called excluded minors. In this thesis, we construct interesting minor-closed …

    csusb Repository record for Exploring Matroid Minors (opens in a new tab)

  11. Some classes of graphs that are nearly cycle-free

    … In this dissertation, we find the full list of excluded minors for the class of graphs that are almost series-parallel. We also obtain the corresponding result for the class of graphs such that uncontracting an edge and then deleting the uncontracted edge produces a series-parallel graph. A …

    lsu-thes Repository record for Some classes of graphs that are nearly cycle-free (opens in a new tab)

  12. Templates for Representable Matroids

    … about representability, extremal functions, and excluded minors. Chapter 1 gives a brief introduction to matroids and matroid structure theory. Chapters 2 and 3 analyze this hypothesis of Geelen, Gerards, and Whittle and propose some refined hypotheses. In Chapter 3, we define frame templates and …

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

  13. Du atsitiktinių grafų modeliai /

    … intersection graphs, graphs with disjoint excluded minors) studied in the thesis, overview the problems and state the main results.

    vilnius Repository record for Du atsitiktinių grafų modeliai / (opens in a new tab)

  14. On two models of random graphs /

    … from minor-closed classes in the case when the excluded minors are disjoint. The class of graphs without k+1 (vertex-)disjoint cycles and more general classes of graphs without k+1 disjoint excluded minors (satisfying a condition related to fans) are considered. Typical graphs in such classes …

    vilnius Repository record for On two models of random graphs / (opens in a new tab)

  15. Even Cycle and Even Cut Matroids

    … The second problem we consider is finding the excluded minors for these classes of matroids. A difficulty when looking for excluded minors for these classes arises from the fact that in general the matroids may have an arbitrarily large number of representations. We define degenerate even cycle …

    waterloo Repository record for Even Cycle and Even Cut Matroids (opens in a new tab)

  16. Connectivity and related properties for graph classes

    … at minor-closed, labelled classes of graphs. The excluded minors are always assumed to be connected, which is equivalent to the class A being decomposable - a graph is in A if and only if every component of the graph is in A. When A is minor-closed, decomposable and bridge-addable various …

    oxford Repository record for Connectivity and related properties for graph classes (opens in a new tab)

  17. Characterizations of Some Classes of Graphs That Are Nearly Series-Parallel

    … is to show that M1 has exactly twelve excluded minors, including K5, the cube, and the octahedron.

    lsu-thes Repository record for Characterizations of Some Classes of Graphs That Are Nearly Series-Parallel (opens in a new tab)

  18. Minors and planar embeddings of digraphs

    … local rotation. Three different variations of minors are presented, each of which produces a finite set of obstructions to clustered planarity. These variations include new operations on digraphs, and measures which refine the partial ordering. Tournaments are digraphs with exactly one edge …

    auckland-ms Repository record for Minors and planar embeddings of digraphs (opens in a new tab)

  19. Selected Problems on Matroid Minors

    … topics include duality, connectivity, matroid minors, and Cunningham and Edmonds's tree decomposition for connected matroids. One of the most well-known excluded-minor results in matroid theory is Tutte's characterization of binary matroids. The class of binary matroids is one of the most …

    lsu-thes Repository record for Selected Problems on Matroid Minors (opens in a new tab)

  20. On the computability of obstruction sets for well-quasi-ordered graph classes

    … αποδείχθηκε στην ίδια σειρά εργασιών (Graph Minors). Όμως αυτά τα αποτελέσματα είναι μη-κατασκευαστικά: ξέρουμε πως κάθε κλάση κλειστή ως προς ελάσσονα ή εμβυθίσεις έχει πεπερασμένο σύνολο παρεμπόδησης αλλά από αυτά τα αποτελέσματα δεν υποδεικνύουν κάποιο αλγόριθμο για να το υπολογίσουμε. Οι …

    athens Repository record for On the computability of obstruction sets for well-quasi-ordered graph classes (opens in a new tab)

Page 1 of 2