On the capacity of graphs

DOI10.1007/BF02018467zbMATH Open0245.05112OpenAlexW2072750184WikidataQ105815880 ScholiaQ105815880MaRDI QIDQ2555083FDOQ2555083

János Komlós, P. Erdős

Publication date: 1973

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02018467

Recommendations

• On the capacity of digraphs
• scientific article; zbMATH DE number 1882352
• Different capacities of a digraph
• On the number of homogeneous subgraphs of a graph
• scientific article; zbMATH DE number 826055

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cited In (5)

• Capacities of graphs and \(2\)-matchings
• Capacity restricted optimal pebbling in graphs
• Connection between conjunctive capacity and structural properties of graphs
• Hofer-Zehnder capacity and Bruhat graph
• On the capacity of Boolean graph formulæ

This page was built for publication: On the capacity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555083)