On a problem of Erdős and Moser

DOI10.1007/s12188-016-0162-1zbMath1457.05054arXiv1502.06832OpenAlexW2570531968MaRDI QIDQ1688260

Béla Bollobás, Alexander D. Scott

Publication date: 5 January 2018

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.06832

zbMATH Keywords

covershypergraphsdirected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a packing and covering problem
• Counting designs
• Projections of Bodies and Hereditary Properties of Hypergraphs
• A Problem on Tournaments
• An extremal problem in graph theory
• An inequality related to the isoperimetric inequality

This page was built for publication: On a problem of Erdős and Moser