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 5 of 5 for “"linear hypergraphs"”.

  1. A Hypergraph Regularity Method for Linear Hypergraphs

    … in extremal hypergraph theory (for so-called linear or simple hypergraphs), including algorithmic ones. This thesis surveys these lighter regularity techiques, and develops three applications of them.

    usf Repository record for A Hypergraph Regularity Method for Linear Hypergraphs (opens in a new tab)

  2. Enumerating combinatorial objects with limited sub-configurations

    … In Chapter 2, we investigate the family of linear hypergraphs with forbidden linear cycles. A substantial part of the work indeed focuses on a closely related problem, the study of the family of graphs with limited short even cycles, which may be of independent interest. To attack this …

    uiuc Repository record for Enumerating combinatorial objects with limited sub-configurations (opens in a new tab)

  3. Sampling uniform hypergraphs with given degrees

    … model relationships between pairs of entities. Hypergraphs are a generalization of graphs in which edges connect an arbitrary number of vertices. We consider hypergraphs in which each edge has size k, each vertex has a degree specified by a degree sequence d, and all edges are unique. These are …

    unsw Repository record for Sampling uniform hypergraphs with given degrees (opens in a new tab)

  4. Coloring Algorithms for Graphs and Hypergraphs with Forbidden Substructures

    … and the List $r$-Coloring Problem restricted to hypergraphs and ordered graphs with forbidden substructures. In the context of forbidding non-induced substructure in hypergraphs, we obtain complete complexity dichotomies of the $r$-Coloring Problem and the $r$-Pre-Coloring Extension Problem in …

    waterloo Repository record for Coloring Algorithms for Graphs and Hypergraphs with Forbidden Substructures (opens in a new tab)

  5. On Algorithmic Fractional Packings of Hypergraphs

    … F of edge-disjoint copies of F0 which are subhypergraphs in H. Let nF0(H) denote the maximum size |F| of an F0-packing F of H. It is well-known that computing nF0(H) is NP-hard for nearly any choice of F0. In this thesis, we consider the special case when F0 is a linear hypergraph, that is, …

    usf Repository record for On Algorithmic Fractional Packings of Hypergraphs (opens in a new tab)