scholarly journals Discrete Convex Functions on Graphs and Their Algorithmic Applications

Author(s):  
Hiroshi Hirai
2004 ◽  
Vol 99 (3) ◽  
pp. 539-562 ◽  
Author(s):  
Kazuo Murota ◽  
Akihisa Tamura

2011 ◽  
Vol 135 (1-2) ◽  
pp. 25-44 ◽  
Author(s):  
Yusuke Kobayashi ◽  
Kazuo Murota ◽  
Robert Weismantel

1984 ◽  
Vol 36 (3) ◽  
pp. 569-576 ◽  
Author(s):  
Imre Bárány ◽  
Zoltán Füredi ◽  
János Pach

A system of openly disjoint discs in the plane is said to form a 6-neighboured circle packing if every is tangent to at least 6 other elements of (It is evident that such a system consists of infinitely many discs.) The simplest example is the regular circle packing all of whose circles are of the same size and have exactly 6 neighbours. L. Fejes Tóth conjectured that the regular circle packing has the interesting extremal property that, if we slightly “perturb” it, then there will necessarily occur either arbitrarily small or arbitrarily large circles. More precisely, he asked whether or not the following “zero or one law” (cf. [3], [6]) is valid: If is a 6-neighboured circle packing, thenwhere r(C) denotes the radius of circle C, inf and sup are taken over all C ∊


Sign in / Sign up

Export Citation Format

Share Document