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 3 of 3 for “"Quasirandomness"”.

  1. Quasirandom forcing in regular tournaments

    … tournaments. We say that a tournament H forces quasirandomness if in every quasirandom sequence (T_n)_{n\in \mathbb{N}} of tournaments of increasing order, the density of H in T_n asymptotically equals its expected value. In contrast to the analogous problem in graphs, it was shown that there …

    uvic Repository record for Quasirandom forcing in regular tournaments (opens in a new tab)

  2. Decompositions of graphs and hypergraphs

    … Secondly, our proof framework applies beyond quasirandomness, enabling us e.g. to deduce a minimum degree version. For graphs, we investigate the minimum degree setting further. In particular, we determine the decomposition threshold' of every bipartite graph, and show that the threshold of …

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

  3. An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs

    Szemere´di’s Regularity Lemma [32, 33] is an important tool in combinatorics, with numerous appli- cations in combinatorial number theory, discrete geometry, extremal graph theory, and theoretical computer science. The Regularity Lemma hinges on the following concepts. Let G = (V, E) be a graph and …

    usf Repository record for An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs (opens in a new tab)