Embedding hypertrees into steiner triple systems

被引：4

作者：

Elliott, Bradley ^{[1
]}

Rodl, Vojtech ^{[1
]}

机构：

[1] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA

来源：

JOURNAL OF COMBINATORIAL DESIGNS | 2019年 / 27卷 / 02期

基金：

美国国家科学基金会;

关键词：

hypergraph; steiner triple system; tree;

D O I：

10.1002/jcd.21641

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper, we are interested in the following question: given an arbitrary Steiner triple system S on m vertices and any 3-uniform hypertree T on n vertices, is it necessary that S contains T as a subgraph provided m >= (1 + mu) n? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive.

引用

页码：82 / 105

页数：24

共 10 条

[1] Nearly perfect matchings in regular simple hypergraphs
Alon, N
Kim, JH
Spencer, J
[J]. ISRAEL JOURNAL OF MATHEMATICS, 1997, 100 (1) : 171 - 187
[2] [Anonymous], 1999, Oxford Mathematics Monographs
[3] SOME REMARKS ON PACKING TREES
BOLLOBAS, B
[J]. DISCRETE MATHEMATICS, 1983, 46 (02) : 203 - 204
[4] Frankl P., 1985, European J. Combin, V6, P317
[5] Gyarfas A., 1978, C MATH SOC J BOLYAI, V1, P463
[6] Janson S., 2000, Wiley-Interscience Series in Discrete Mathematics and Optimization, DOI 10.1002/9781118032718
[7] Fractional v integral covers in hypergraphs of bounded edge size
Kahn, J
Kayll, PM
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1997, 78 (02) : 199 - 235
[8] Lovasz L., 2003, UNDERGRADUATE TEXTS
[9] ASYMPTOTIC-BEHAVIOR OF THE CHROMATIC INDEX FOR HYPERGRAPHS
PIPPENGER, N
SPENCER, J
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1989, 51 (01) : 24 - 42
[10] Polya G., 1987, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds

← 1 →