Balanced extensions of graphs and hypergraphs |
| |
Authors: | A Rucinski A Vince |
| |
Institution: | 1. Department of Statistics, University of Florida, 32611, Gainesville, FL, USA 2. Department of Mathematics, University of Florida, 32611, Gainesville, FL, USA
|
| |
Abstract: | For a hypergraphG withv vertices ande i edges of sizei, the average vertex degree isd(G)= ∑ie 1/v. Callbalanced ifd(H)≦d(G) for all subhypergraphsH ofG. Let $$m(G) = \mathop {\max }\limits_{H \subseteqq G} d(H).$$ A hypergraphF is said to be abalanced extension ofG ifG?F, F is balanced andd(F)=m(G), i.e.F is balanced and does not increase the maximum average degree. It is shown that for every hypergraphG there exists a balanced extensionF ofG. Moreover everyr-uniform hypergraph has anr-uniform balanced extension. For a graphG let ext (G) denote the minimum number of vertices in any graph that is a balanced extension ofG. IfG hasn vertices, then an upper bound of the form ext(G) 1 n 2 is proved. This is best possible in the sense that ext(G)>c 2 n 2 for an infinite family of graphs. However for sufficiently dense graphs an improved upper bound ext(G) 3 n can be obtained, confirming a conjecture of P. Erdõs. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|