Embedding hypertrees into steiner triple systems

descriptionPublicationkeyboard_double_arrow_right Article , Preprint , Other literature type 08 Nov 2018Embargo end date: 01 Jan 2018 English Publisher:WileyJournal:Journal of Combinatorial Designs, volume 27, pages 82-105 (issn: 1063-8539, eissn: 1520-6610,

Copyright policy )Funded by:NSF | Extremal and Ramsey-Type ...

Authors: Bradley Elliott; Vojtěch Rödl;

doi: 10.1002/jcd.21641 , 10.48550/arxiv.1804.08191

arXiv: 1804.08191

Embedding hypertrees into steiner triple systems

- Summary
- Subjects
- Metrics

Abstract

AbstractIn this paper, we are interested in the following question: given an arbitrary Steiner triple systemonvertices and any 3‐uniform hypertreeonvertices, is it necessary thatcontainsas a subgraph provided? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive.

Related Organizations

Emory University
United States
University of Atlanta
United States

Keywords

FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average