DeepAI AI Chat

Every Steiner triple system contains an almost spanning d-ary hypertree

05/23/2021

∙

by Andrii Arman, et al.

∙

Emory University

∙

∙

In this paper we make a partial progress on the following conjecture: for every μ>0 and large enough n, every Steiner triple system S on at least (1+μ)n vertices contains every hypertree T on n vertices. We prove that the conjecture holds if T is a perfect d-ary hypertree.

Andrii Arman
3 publications
Vojtech Rodl
3 publications
Marcelo Tadeu Sales
1 publication

page 1

page 2

page 3

page 4

∙ 07/08/2022

The Burning Number Conjecture Holds Asymptotically

The burning number b(G) of a graph G is the smallest number of turns req...

0 Sergey Norin, et al. ∙

∙ 10/12/2021

Embedding perfectly balanced 2-caterpillar into its optimal hypercube

A long-standing conjecture on spanning trees of a hypercube states that ...

0 Rishikant Rajdeepak, et al. ∙

∙ 10/09/2019

The Resolution of Keller's Conjecture

We consider two graphs, G_7,3 and G_7,4, related to Keller's conjecture ...

0 Joshua Brakensiek, et al. ∙

∙ 08/17/2020

Binary scalar products

Let A,B ⊆ℝ^d both span ℝ^d such that ⟨ a, b ⟩∈{0,1} holds for all a ∈ A,...

0 Andrey Kupavskii, et al. ∙

∙ 06/06/2019

On the distribution of runners on a circle

Consider n runners running on a circular track of unit length with const...

0 Pavel Hrubes, et al. ∙

∙ 11/25/2021

On the quartet distance given partial information

Let T be an arbitrary phylogenetic tree with n leaves. It is well-known ...

0 Sagi Snir, et al. ∙

∙ 02/04/2023

The Scholz conjecture for n=2^m(23)+7, m ∈ℕ^*

The Scholz conjecture on addition chains states that ℓ(2^n-1) ≤ℓ(n) + n ...

0 Amadou Tall, et al. ∙