Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Proofs from THE BOOK - MaRDI portal

Proofs from THE BOOK

From MaRDI portal
Publication:4571707

DOI10.1007/978-3-662-57265-8zbMath1392.00001OpenAlexW4248469012MaRDI QIDQ4571707

Martin Aigner, Günter M. Ziegler

Publication date: 29 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-57265-8




Related Items (50)

Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matricesTorsion groups do not act on 2-dimensional \(\text{CAT}(0)\) complexesTopology and geometry of random 2-dimensional hypertreesA CONTINUOUS HOMOMORPHISM OF A THIN SET ONTO A FAT SETOn a \(q\)-deformation of modular formsA replication crisis in mathematics?The \(n\)-queens completion problemA Gauche Perspective on Row Reduced Echelon Form and Its UniquenessAN EXTENSION OF FURSTENBERG’S THEOREM OF THE INFINITUDE OF PRIMESOn the Cardinality of Sets in $R^d$ Obeying a Slightly Obtuse Angle BoundSpanning tree enumeration and nearly triangular graph LaplaciansPlanar Turán numbers of cycles: a counterexampleA remark on the enumeration of rooted labeled treesThe traveling salesman theorem for Jordan curvesThe card guessing game: a generating function approachMoments of the one-shuffle no-feedback card guessing gameLattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total PositivityThe Moran forestInfinitely Many New Derivations of the Geometric ExpectationCoefficientwise total positivity of some matrices defined by linear recurrencesAdditive groups with many unimodular elementsWetzel: formalisation of an undecidable problem linked to the continuum hypothesisHall's theorem for enumerable families of finite setsFinding biclique partitions of co-chordal graphsProof of the Brunn-Minkowski theorem by elementary methodsRecognition of affine-equivalent polyhedra by their natural developmentsExtensions of the Art Gallery TheoremSymmetries of 3-polytopes with fixed edge lengthUnnamed ItemUnnamed ItemA Representation Theorem for Generic Line Arrangements in the PlaneOn the mean-field equations for ferromagnetic spin systemsOn the Thue-Vinogradov lemmaMorley Trisectors and the Law of Sines with ReflectionsEnumerating threshold graphs and some related graph classesCounting parallel segments: new variants of Pick's area theoremInfinitude of primes: Euclid's proof using angles between lattice vectorsLinear Algebraic Techniques for Spanning Tree EnumerationOn the generic family of Cayley graphs of a finite groupDavid Hilbert and the foundations of the theory of plane areaA unified construction of semiring-homomorphic graph invariantsA Portrait of the Mathematical TribeUnnamed ItemGeneralized rook polynomialsContinuous cubic formulations for cluster detection problems in networks2-Layer k-Planar GraphsShortcut graphs and groupsLarry Wos: visions of automated reasoningA Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique ProblemGeneralized dissections and Monsky's theorem




This page was built for publication: Proofs from THE BOOK