On r-uniform hypergraphs with circumference less than r

Add time:08/29/2019    Source:sciencedirect.com

We show that for each k≥4 and n>r≥k+1, every n-vertex hypergraph with edge sizes at least r and no Berge cycle of length at least k has at most (k−1)(n−1)r edges. The bound is exact, and we describe the extremal hypergraphs. This implies and slightly refines the theorem of Győri, Katona and Lemons that for n>r≥k≥3, every n-vertex r-uniform hypergraph with no Berge path of length k has at most (k−1)nr+1 edges. To obtain the bounds, we study bipartite graphs with no cycles of length at least 2k, and then translate the results into the language of multi-hypergraphs.

We also recommend Trading Suppliers and Manufacturers of (R)-1-Boc-3-cyanopyrrolidine (cas 132945-76-7). Pls Click Website Link as below: cas 132945-76-7 suppliers

Prev:5-Lipoxygenase as a drug target: A review on trends in inhibitors structural design, SAR and mechanism based approach
Next:Synthesis and SAR of 2-(4-fluorophenyl)-3-pyrimidin-4-ylimidazo[1,2-a]pyridine derivatives as anticoccidial agents)