On the maximum size of connected hypergraphs without a path of given length (Q724883): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Connected graphs without long paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Erdős-Gallai type theorem for uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852213 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum number of cliques in graphs without long cycles / rank | |||
Normal rank |
Latest revision as of 05:53, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the maximum size of connected hypergraphs without a path of given length |
scientific article |
Statements
On the maximum size of connected hypergraphs without a path of given length (English)
0 references
26 July 2018
0 references
connected hypergraph
0 references
Erdős-Gallai theorem
0 references
Berge hypergraph
0 references