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 307 for “"Hypergraphs"”.

  1. Universal Hypergraphs.

    In this thesis, we study universal hypergraphs. What are these? Let us start with defining a universal graph as a graph on n vertices that contains each of the many possible graphs of a smaller size k < n as an induced subgraph. A hypergraph is a discrete structure on n vertices in which edges can …

    etsu Repository record for Universal Hypergraphs. (opens in a new tab) Download PDF for Universal Hypergraphs. (opens in a new tab)

  2. Coloring clique hypergraphs

    … s-coloring of CH(G). We prove that the clique hypergraphs of chordal and comparability graphs are bicolorable and that the clique hypergraphs of circular-arc graphs are 3-colorable. Our main result is the characterization of (W, 2)-extendibility for chordal graphs in the case when W=2 .

    wvu Repository record for Coloring clique hypergraphs (opens in a new tab)

  3. Spectra of Hypergraphs

    We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A number of developments building upon classical work has led to a rich understanding of 'symmetric hyperdeterminants' of hypermatrices, a.k.a. multidimensional arrays. Symmetric hyperdeterminants …

    south-carolina Repository record for Spectra of Hypergraphs (opens in a new tab)

  4. Synthesis With Hypergraphs

    Many problems related to synthesis with intelligent tutoring may be phrased as program synthesis problems using AI-style search and formal reasoning techniques. The _x000C_first two results in this dissertation focus on problem synthesis as an aspect of intelligent tutoring systems applied to …

    lsu-thes Repository record for Synthesis With Hypergraphs (opens in a new tab)

  5. Self-complementary hypergraphs

    … the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which are k-complementing. The k-complementing permutations map the edges of a k-uniform hypergraph to …

    ottawa-retro Repository record for Self-complementary hypergraphs (opens in a new tab)

  6. Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts

    … --- treatment of this subject has only begun on hypergraphs in the last decade. Other authors have produced results about rank-2 universal cycles and 1-overlap cycles, which are equivalent to our definition of Euler tours. In contrast, an Euler family is a collection of nontrivial closed walks …

    ottawa-retro Repository record for Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts (opens in a new tab)

  7. Learning on Inhomogeneous Hypergraphs

    … relations. Such relations can be modeled by hypergraphs, where the notion of an edge is generalized to a hyperedge that can connect more than two vertices. Traditional hypergraph models treat all the vertices in a hyperedge equally while in practice these vertices might contribute differently …

    rice Repository record for Learning on Inhomogeneous Hypergraphs (opens in a new tab)

  8. On Unavoidable Infinite Hypergraphs

    … dissertation is to obtain analogous results for hypergraphs. This work is split into two main chapters. First, we focus on hypergraphs that contain a vertex of infinite degree, and find that the unavoidable members are obtained from a finite hypergraph by a specific method of replicating and …

    lsu-thes Repository record for On Unavoidable Infinite Hypergraphs (opens in a new tab)

  9. Facets of conflict hypergraphs

    … set polytope using the concept of conflict hypergraphs. A conflict hypergraph is a hypergraph whose vertices correspond to the binary variables, and edges correspond to covers in the constraint matrix of the independent set polytope. Various structures such as cliques, odd holes, odd …

    gatech Repository record for Facets of conflict hypergraphs (opens in a new tab)

  10. Matching problems in hypergraphs

    … by 3, if F_1, ..., F_{n/3} are 3-uniform hypergraphs with a common vertex set and the minimum vertex degree in each F_i is greater than {(n-1) choose 2} - {2n/3 choose 2} for i = 1, ..., n/3, then the family {F_1, ..., F_{n/3}} admits a rainbow matching, i.e., a matching consisting of one …

    gatech Repository record for Matching problems in hypergraphs (opens in a new tab)

  11. Hypergraphs and their homology

    … which will play a major role in this thesis, are hypergraphs and simplicial complexes. Hypergraphs have grown in popularity over the past decades, and are becoming standard combinatorial objects used in network representations. They differ from graphs only in that an edge in a hypergraph can have …

    msu Repository record for Hypergraphs and their homology (opens in a new tab)

  12. Matchings and Covers in Hypergraphs

    … variations of matching and covering problems in hypergraphs. The first is motivated by an old conjecture of Ryser which says that if $\mcH$ is an $r$-uniform, $r$-partite hypergraph which does not have a matching of size at least $\nu +1$, then $\mcH$ has a vertex cover of size at most …

    waterloo Repository record for Matchings and Covers in Hypergraphs (opens in a new tab)

  13. On the orientation of hypergraphs

    … In this thesis we study out-orientations of hypergraphs, where every hyperarc has one tail vertex. We study hypergraphs that admit out-orientations covering supermodular-type connectivity requirements. For this, we follow a paper of Frank. We also study the Steiner rooted orientation problem. …

    waterloo Repository record for On the orientation of hypergraphs (opens in a new tab)

  14. Decompositions of graphs and hypergraphs

    … theory and edge decompositions of graphs and hypergraphs. Most notably, we give a new proof of the existence conjecture, dating back to the 19th century. For \(r\)-graphs \(F\) and \(G\), an \(F\)-decomposition of G is a collection of edge-disjoint copies of F in G covering all edges of \(G\). …

    birmingham Download PDF for Decompositions of graphs and hypergraphs (opens in a new tab)

  15. Eigenvalues of K-Uniform Hypergraphs

    … to generalize the de nition of eigenvalues to hypergraphs and show several results related to each. The rst approach is rooted in 2-dimensional matrices and allows for the generalization of many results from graph theory. The second approach covered is more sophisticated and may only be applied …

    regina Repository record for Eigenvalues of K-Uniform Hypergraphs (opens in a new tab) Download PDF for Eigenvalues of K-Uniform Hypergraphs (opens in a new tab)

  16. Mining Associations Using Directed Hypergraphs

    This thesis proposes a novel directed hypergraph based model for any database. We introduce the notion of association rules for multi-valued attributes, which is an adaptation of the definition of quantitative association rules known in the literature. The association rules for multi-valued …

    usf Repository record for Mining Associations Using Directed Hypergraphs (opens in a new tab)

  17. Modular decomposition of k-hypergraphs

    … notion of modules in graphs has been extended to hypergraphs by Bonizzoni and Della Vedova [6]. Bonizzoni and Della Vedova also provide an algorithm to compute the decomposition tree with a time-bound of O(n3k–5), where k is the maximum size of hyperedges in the hypergraph. In this thesis, I …

    colostate Repository record for Modular decomposition of k-hypergraphs (opens in a new tab)

  18. Some Combinatorial Games on Hypergraphs

    … problems and presents three games played on hypergraphs. In Chapter 2, we present theoretical results related to the existence of paths and expanders in hypergraphs. Chapters 3 and 4 discuss properties of random graph processes and an approximation of the number of edges in a k-nearest …

    cau-kiel Repository record for Some Combinatorial Games on Hypergraphs (opens in a new tab)

  19. Matchings and Flows in Hypergraphs

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

    fu-berlin Repository record for Matchings and Flows in Hypergraphs (opens in a new tab)

  20. Extremal Hypergraphs for Ryser's Conjecture

    … characterization of all $3$-partite $3$-uniform hypergraphs $\mathcal{H}$ for which $\tau(\cmathcal{H}) = 2\nu(\mathcal{H})$, in other words, the extremal hypergraphs for Ryser's Conjecture for $r = 3$. These all have a special form, which we call "home-base" hypergraphs. They consist of …

    fu-berlin Repository record for Extremal Hypergraphs for Ryser's Conjecture (opens in a new tab)

Page 1 of 16