Berge Cycles in Non-Uniform Hypergraphs
Copyright policy )Berge Cycles in Non-Uniform Hypergraphs
We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases.
- University of California, San Francisco United States
- Luo, Ruth United States
- University of California System United States
- University of Illinois at Urbana Champaign United States
- University of California, San Diego United States
Extremal problems in graph theory, Dirac-type minimum degree conditions, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hypergraphs, Enumeration in graph theory, set systems without long Berge cycles, Paths and cycles
Extremal problems in graph theory, Dirac-type minimum degree conditions, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hypergraphs, Enumeration in graph theory, set systems without long Berge cycles, Paths and cycles
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).1 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.Average 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
Citations provided by BIP!Popularity provided by BIP!