Large girth approximate Steiner triple systems

@article{Bohman2018LargeGA,
  title={Large girth approximate Steiner triple systems},
  author={Tom Bohman and Lutz Warnke},
  journal={Journal of the London Mathematical Society},
  year={2018},
  volume={100}
}
  • T. BohmanL. Warnke
  • Published 3 August 2018
  • Mathematics
  • Journal of the London Mathematical Society
In 1973, Erdős asked whether there are n ‐vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g⩾4 for which some g ‐element vertex‐set contains at least g−2 triples.) 

A randomized construction of high girth regular graphs

It is shown that with high probability this algorithm yields a $k-regular graph with girth at least $g$ and implies that there are $\left( \Omega (n) \right)^{kn/2}$ labeled $k$-regular $n$-vertex graphs with g diameter at least g.

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems

A famous theorem of Kirkman says that there exists a Steiner triple system of order n if and only if n ≡ 1,3 mod 6. In 1973, Erdős conjectured that one can find so-called ‘sparse’ Steiner triple

Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points

For a family F of r ‐graphs, let ex(n,F) denote the maximum number of edges in an F ‐free r ‐graph on n vertices. Let Fr(v,e) denote the family of all r ‐graphs with e edges and at most v vertices.

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems

This work proves the Erdős conjecture that one can find so-called ‘sparse’ Steiner triple systems with arbitrary parameters asymptotically by analysing a natural generalization of the triangle removal process.

Counting extensions revisited

We consider rooted subgraphs in random graphs, that is, extension counts such as (i) the number of triangles containing a given vertex or (ii) the number of paths of length three connecting two given

On partial Steiner (n, r, `)-system process

For given integers r and ` such that 2 ≤ ` ≤ r − 1, an r-uniform hypergraph H is called a partial Steiner (n, r, `)-system, if every subset of size ` lies in at most one edge of H. In particular,

Triple systems with no three triples spanning at most five points

  • Stefan Glock
  • Mathematics
    Bulletin of the London Mathematical Society
  • 2018
We show that the maximum number of triples on n points, if no three triples span at most five points, is (1±o(1))n2/5 . More generally, let f(r)(n;k,s) be the maximum number of edges in an r ‐uniform

Prague dimension of random graphs

It is shown that the Prague dimension of the binomial random graph is typically of order n/log n for constant edge-probabilities, i.e., edges of size O(log n) for random hypergraphs with large uniformities.

Extremal aspects of graph and hypergraph decomposition problems

We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open

References

SHOWING 1-10 OF 37 REFERENCES

5-sparse Steiner Triple Systems of Order n Exist for Almost All Admissible n

  • A. Wolfe
  • Mathematics
    Electron. J. Comb.
  • 2005
This paper gives a proof that the spectrum of orders of 5-sparse Steiner triple systems has arithmetic density $1$ as compared to the admissible orders.

On 6-sparse Steiner triple systems

The Resolution of the Anti-Pasch Conjecture

We show that an anti-Pasch Steiner triple system of order $v$ exists for $v\equiv 1$ or 3 (mod 6), apart from $v=7$ and 13.

Counting designs

We give estimates on the number of combinatorial designs, which prove (and generalise) a conjecture of Wilson from 1974 on the number of Steiner Triple Systems. This paper also serves as an

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems

This work proves the Erdős conjecture that one can find so-called ‘sparse’ Steiner triple systems with arbitrary parameters asymptotically by analysing a natural generalization of the triangle removal process.

A note on the random greedy triangle-packing algorithm

It is shown that with high probability the number of edges in the final graph is at most O(n/4) -log^{5/4}n, while the random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows.

On a conjecture of Erd\H{o}s on locally sparse Steiner triple systems

A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n\equiv 1,3\mod{6}$. In 1976, Erd\H{o}s conjectured that one can find so-called `sparse'

Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems

Three constructions for anti‐mitre Steiner triple systems and a construction for 5‐sparse ones are presented and it is shown that one can construct anti-mitre systems for at least 13/14 of the admissible orders.

On Regular Hypergraphs of High Girth

A random $r-uniform `Cayley' hypergraph on $S_n$ which has girth $\Omega (n^{1/3})$ with high probability, in contrast to random regular $r$- uniform hypergraphs, which have constant girth with positive probability.

Extremal problems for triple systems

In this article Turan-type problems for several triple systems arising from (k, k − 2)-configurations [i.e. (k − 2) triples on k vertices] are considered. It will be shown that every Steiner triple