Geometrical design of ligands for spherical ions
- 作者V. E. Kuzmin; I. S. Rublev; D. V. Naroditskii; E. V. Gapon
- 卷第36卷
- 期第5期
- 印刷ISSN0022-4766
- 电子ISSN1573-8779
- 文件大小202.88KB
- 发表时间1995-0910
- DOI10.1007/bf02579671
- 页码798-802
Terminal-pairability in complete bipartite graphsColucci, Lucas; Erdős, Péter L.; Győri, Ervin; Mezei, Tamás Róbert · Discrete Applied Mathematics · 2017
Pentagons vs. trianglesBéla Bollobás; Ervin Győri · 2008
Guest Editors’ ForewordZoltán Füredi; Ervin Győri; János Pach; Attila Sali · 2008
Cyclability in -connected -free graphsEvelyne Flandrin; Ervin Győri; Hao Li; Jinlong Shu · 2010
PrefaceJarik Nešetřil; Ervin Győri; Attila Sali · 2011
PrefaceGyőri, Ervin; Nešetřil, Jaroslav; Sali, Attila · European Journal of Combinatorics · 2014
Mobile versus Point GuardsGyőri, Ervin; Mezei, Tamás Róbert · Discrete & Computational Geometry · 2018
Hypergraphs with no cycle of length 4Ervin Győri; Nathan Lemons · 2012
Diametric theorems in sequence spacesR. Ahlswede; N. Cai; Z. Zhang · Combinatorica · 1992
Small transversals in hypergraphsV. Chvátal; C. McDiarmid · Combinatorica · 1992
On integer points in polyhedraW. Cook; M. Hartmann; R. Kannan; C. McDiarmid · Combinatorica · 1992
Spanning trees of extended graphsA. K. Kelmans · Combinatorica · 1992
On rank vs. communication complexityNoam Nisan; Avi Wigderson · Combinatorica · 1995
Colouring a graph frugallyHugh Hind; Michael Molloy; Bruce Reed · Combinatorica · 1997
Expanding graphs and invariant meansYehuda Shalom · Combinatorica · 1997
Universally signable graphsMichele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković · Combinatorica · 1997