The balancing number and generalized balancing number of some graph classes

DOI10.37236/10032OpenAlexW4317702506MaRDI QIDQ2692189

Antoine Dailly, Adriana Hansberg, Laura Eslava, Denae Ventura

Publication date: 21 March 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

balanced copy

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unavoidable subgraphs of colored graphs
• Unavoidable patterns
• Ramsey theory. Yesterday, today, and tomorrow
• Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
• On zero-sum spanning trees and zero-sum connectivity
• On small balanceable, strongly-balanceable and omnitonal graphs
• The formula for Turán number of spanning linear forests
• Low weight perfect matchings
• On the balanceability of some graph classes
• Turán theorems for unavoidable patterns
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On a problem of K. Zarankiewicz
• On the existence of zero-sum perfect matchings of complete graphs
• Unavoidable chromatic patterns in 2‐colorings of the complete graph

This page was built for publication: The balancing number and generalized balancing number of some graph classes