On a generalized Erdős–Rademacher problem

DOI10.1002/jgt.22768zbMath1522.05130arXiv2005.07224OpenAlexW3212190075MaRDI QIDQ6057585

Dhruv Mubayi, Xizhi Liu

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Rademacher problemcolor critical graphstriangle covering number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On stability of the Erdős-Rademacher problem

Cites Work

• On a theorem of Rademacher-Turán
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Counting substructures. I: Color critical graphs
• The number of triangles is more when they have no common vertex
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a generalized Erdős–Rademacher problem