Carbonero, Alvaro and Fletcher, Willem and Guo, Jing and Gyarfas, Andras and Wang, Rona and Yan, Shiyu (2022) Crowns in linear 3-graphs of minimum degree 4. ELECTRONIC JOURNAL OF COMBINATORICS, 29 (4): P4.17. ISSN 1077-8926
Full text not available from this repository. (Request a copy)Abstract
A 3-graph is a pair H = (V, E) of sets, where elements of V are called points or vertices and E contains some 3-element subsets of V, called edges. A 3-graph is called linear if any two distinct edges intersect in at most one vertex. There is a recent interest in extremal properties of 3-graphs containing no crown, three pairwise disjoint edges and a fourth edge which intersects all of them. We show that every linear 3-graph with minimum degree 4 contains a crown. This is not true if 4 is replaced by 3.
| Item Type: | Article |
|---|---|
| Subjects: | 500 Science > 510 Mathematics |
| Divisions: | Mathematics |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 16 Feb 2024 08:25 |
| Last Modified: | 16 Feb 2024 08:25 |
| URI: | https://pred.uni-regensburg.de/id/eprint/57987 |
Actions (login required)
 |
View Item |
