Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Geometry, Structure and Randomness in Combinatorics / / edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini
| Geometry, Structure and Randomness in Combinatorics / / edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2014 |
| Descrizione fisica | 1 online resource (156 p.) |
| Disciplina |
510
516.1 |
| Collana | CRM Series |
| Soggetto topico |
Convex geometry
Discrete geometry Convex and Discrete Geometry |
| ISBN | 88-7642-525-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Imre Bárány: Tensors, colours, octahedral -- Maria Chudnovsky: Cliques and stable sets in undirected graphs -- Mauro Di Nasso: A taste of nonstandard methods in combinatorics of numbers -- Béla Bollobás, Zoltán Füredi, Ida Kantor, G. O. H. Katona and Imre Leader: A coding problem for pairs of subsets -- Jirí Matousek: String graphs and separators -- Jaroslav Nesetril and Patrice Ossona de Mendez: On first-order definable colorings -- Ryan Schwartz and József Solymosi: Combinatorial applications of the subspace theorem -- Peter Hegarty and Dmitry Zhelezov: Can connected commuting graphs of finite groups have arbitrarily large diameter? |
| Record Nr. | UNINA-9910299966003321 |
| Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A Journey Through Discrete Mathematics : A Tribute to Jiří Matoušek / / edited by Martin Loebl, Jaroslav Nešetřil, Robin Thomas
| A Journey Through Discrete Mathematics : A Tribute to Jiří Matoušek / / edited by Martin Loebl, Jaroslav Nešetřil, Robin Thomas |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXXIV, 810 p. 160 illus., 54 illus. in color.) |
| Disciplina | 518.1 |
| Soggetto topico |
Algorithms
Combinatorial analysis Geometry Operations research Management science Algebraic topology Computer science—Mathematics Combinatorics Operations Research, Management Science Algebraic Topology Mathematics of Computing |
| ISBN | 3-319-44479-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simplex Range Searching and Its Variants: A Review: Pankaj K. Agarwal.- Fair Representation by Independent Sets: Ron Aharoni, Noga Alon, Eli Berger, Maria Chudnovsky, Dani Kotlar, Martin Loebl, and Ran Ziv.- Computing Heegaard Genus Is NP-Hard: David Bachman, Ryan Derby-Talbot, and Eric Sedgwick.- Approximation-Friendly Discrepancy Rounding: Nikhil Bansal and Viswanath Nagarajan.- A Tverberg Type Theorem for Matroids: Imre Barany, Gil Kalai, Roy Meshulam.- Gershgorin Disks for Multiple Eigenvalues of Non-Negative Matrices: Imre Bárány and József Solymosi.- Computing the Partition Function of a Polynomial on the Boolean Cube: Alexander Barvinok -- Siegel's Lemma Is Sharp: József Beck.- On Codimension One Embedding of Simplicial Complexes: Anders Björner and Afshin Goodarzi -- Around Brouwer's Fixed Point Theorem: Anders Björner, Jiri Matousek, and Günter M. Ziegler.- Beyond the Borsuk-Ulam Theorem: The Topological Tverberg Story: Pavle V. M. Blagojevic and Günter M. Ziegler.- One-Sided Epsilon-Approximants: Boris Bukh and Gabriel Nivasch.- A Note on Induced Ramsey Numbers: David Conlon, Domingos Dellamonica Jr., Steven La Fleur, Vojtech Rödl, and Mathias Schacht.- ARRIVAL: A Zero-Player Graph Game in NP \ coNP: Jerome Dohrau, Bernd Gärtner, Manuel Kohler, Jiri Matousek, and Emo Welzl.- Constant-Factor Approximation for TSP with Disks: Adrian Dumitrescu, and Csaba D. Toth.- Transport-Entropy Inequalities and Curvature in Discrete-State Markov Chains: Ronen Eldan, James R. Lee, and Joseph Lehec.- Bounding Helly Numbers Via Betti Numbers: Xavier Goaoc, Pavel Patak, Zuzana Patakova, Martin Tancer, and Uli Wagner.- Ruled Surface Theory and Incidence Geometry: Larry Guth.- Approximating the k-Level in Three-Dimensional Plane Arrangements: Sariel Har-Peled, Haim Kaplan, and Micha Sharir.- Schrijver Graphs and Projective Quadrangulations: Tomas Kaiser and Matej Stehlik.- Near-Optimal Lower Bounds for nets for Halfspaces and Low Complexity Set Systems: Andrey Kupavskii, Nabil H. Mustafa, and Janos Pach.- Random Simplicial Complexes - Around the Phase Transition: Nathan Linial and Yuval Peled.- Nullspace Embeddings for Outerplanar Graphs: Laszlo Lovasz and Alexander Schrijver.- Homology of Spaces of Directed Paths in Euclidean Pattern Spaces: Roy Meshulam and Martin Raussen.- Sperner's Colorings and Optimal Partitioning of the Simplex: Maryam Mirzakhani and Jan Vondrak.- Teaching and Compressing for Low VC-Dimension: Shay Moran, Amir Shpilka, Avi Wigderson, and Amir Yehudayo.- Restricted Invertibility Revisited: Assaf Naor and Pierre Youssef.- Rational Polygons: Odd Compression Ratio and Odd Plane Coverings: Rom Pinchasi and Yuri Rabinovich.- First Order Probabilities for Galton{Watson Trees: Moumanti Podder and Joel Spencer.- Crossing-Free Perfect Matchings in Wheel Point Sets: Andres J. Ruiz-Vargas and Emo Welzl.- Network Essence: Page Rank Completion and Centrality-Conforming Markov Chains: Shang-Hua Teng.- Anti-Concentration Inequalities for Polynomials: Van Vu. |
| Record Nr. | UNINA-9910254287203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical and Engineering Methods in Computer Science [[electronic resource] ] : 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers / / edited by Antonin Kucera, Thomas A. Henzinger, Jaroslav Nešetřil, Tomas Vojnar, David Antos
| Mathematical and Engineering Methods in Computer Science [[electronic resource] ] : 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers / / edited by Antonin Kucera, Thomas A. Henzinger, Jaroslav Nešetřil, Tomas Vojnar, David Antos |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 213 p. 32 illus.) |
| Disciplina | 005.1 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer communication systems Algorithms Management information systems Computer science Economic theory Software Engineering Computer Communication Networks Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Economic Theory/Quantitative Economics/Mathematical Methods |
| ISBN | 3-642-36044-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | BDD-Based Software Model Checking with CPAchecker -- Security for Cyber-Physical Systems -- Quantum Secret Sharing with Graph States -- Testing Embedded Memories: A Survey -- Quicksort and Large Deviations -- Recent Results on Howard’s Algorithm -- Advantage of Quantum Strategies in Random Symmetric XOR Games -- Verification of Liveness Properties on Closed Timed-Arc Petri Nets -- Fast Algorithm for Rank-Width -- Determinacy in Stochastic Games with Unbounded Payoff Functions -- Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games -- Controllable-Choice Message Sequence Graphs -- A Better Way towards Key Establishment and Authentication in Wireless Sensor Networks -- Parameterized Algorithms for Stochastic Steiner Tree Problems -- Action Investment Energy Games -- Ciphertext-Only Attack on Gentry-Halevi Implementation of Somewhat Homomorphic Scheme -- Grover’s Algorithm with Errors -- On WQO Property for Different Quasi Orderings of the Set of Permutations -- Towards User-Aware Multi-touch Interaction Layer for Group Collaborative Systems. |
| Record Nr. | UNISA-996465998903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013 / / edited by Jaroslav Nešetřil, Marco Pellegrini
| The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013 / / edited by Jaroslav Nešetřil, Marco Pellegrini |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2013 |
| Descrizione fisica | 1 online resource (612 p.) |
| Disciplina |
511.5
511.6 |
| Collana | CRM Series |
| Soggetto topico |
Combinatorial analysis
Graph theory Mathematics Combinatorics Graph Theory |
| ISBN | 88-7642-475-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Erdős problems -- A problem of Erdős and Sós on 3-graphs / Roman Glebov, Daniel Král’, Jan Volec -- An analogue of the Erdős-Ko-Rado theorem for multisets / Zoltán Füredi, Dániel Gerbner, Máté Vizer -- Polynomial gap extensions of the Erdős-Pósa theorem / Jean-Florent Raymond, Dimitrios M. Thilikos -- The Erdős-Pósa property for long circuits / Dirk Meierling, Dieter Rautenbach, Thomas Sasse -- Hypergraphs -- A hypergraph Turán theorem via Lagrangians of intersecting families / Dan Hefetz, Peter Keevash -- Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs / Andrew Treglown, Yi Zhao -- Fractional and integer matchings in uniform hypergraphs / Daniela Kühn, Deryk Osthus, Timothy Townsend -- Cubic graphs -- On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings / Louis Esperet, Giuseppe Mazzuoccolo -- Relating ordinary and total domination in cubic graphs of large girth / Simone Dantas, Felix Joos, Christian Löwenstein, Dieter Rautenbach, Deiwison S. Machado -- Snarks with large oddness and small number of vertices / Robert Lukot’ka, Edita Máčajová, Ján Mazák, Martin Škoviera -- Non-trivial snarks with given circular chromatic index / Robert Lukot’ka, Ján Mazák -- Graphs -- The graph formulation of the union-closed sets conjecture / Henning Bruhn, Pierre Charbit, Jan Arne Telle -- The union-closed sets conjecture almost holds for almost all random bipartite graphs / Henning Bruhn, Oliver Schaudt -- The robust component structure of dense regular graphs / Daniela Kühn, Allan Lo, Deryk Osthus, Katherine Staden -- The (Δ, D) and (Δ, N) problems in double-step digraphs with unilateral diameter / Cristina Dalfó, Miquel Àngel Fiol -- Critical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields / Swee Hong Chan, Henk D. L. Hollmann, Dmitrii V. Pasechnik -- Two notions of unit distance graphs / Noga Alon, Andrey Kupavskii -- An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs / Aida Abiad, Miquel A. Fiol, Willem H. Haemers, Guillem Perarnau -- On the structure of the group of balanced labelings on graphs / Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit -- The price of connectivity for feedback vertex set / Rémy Belmonte, Pim van’t Hof, Marcin Kamiński, Daniël Paulusma -- A local flow algorithm in bounded degree networks / Endre Csóka -- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects / Fabrício Benevides, Victor Campos, Mitre C. Dourado, Rudini M. Sampaio, Ana Silva -- A multipartite Hajnal-Szemerédi theorem / Peter Keevash, Richard Mycroft -- Directed cycle double covers: hexagon graphs / Andrea Jiménez, Mihyun Kang, Martin Loebl -- Finding an Odd K 3,3 / Peter Whalen, Robin Thomas -- Zero-error source-channel coding with entanglement / Jop Briët, Harry Buhrman, Monique Laurent, Teresa Piovesan, Giannicola Scarpa --
Ramsey Theory -- Ramsey numbers for bipartite graphs with small bandwidth / Guilherme O. Mota, Gábor N. Sárkőzy, Mathias Schacht, Anusch Taraz -- Polynomial bounds on geometric Ramsey numbers of ladder graphs / Josef Cibulka, Pu Gao, Marek Krčál, Tomáš Valla, Pavel Valtr -- Geometry and Surfaces -- Arrangements of pseudocircles and circles / Ross J. Kang, Tobias Müller -- Extended abstract for structure results for multiple tilings in 3D / Nick Gravin, Mihail N. Kolountzakis, Sinai Robins, Dmitry Shiryaev -- On the nonexistence of k-reptile simplices in 3 ana 4 / Jan Kynčl, Zuzana Safernová / -- Homogeneous selections from hyperplanes / Imre Bárány, János Pach -- Conic theta functions and their relations to theta functions / Amanda Folsom, Winfried Kohnen, Sinai Robins -- The Carathéodory number of the P 3 convexity of chordal graphs / Erika M. M. Coelho, Mitre C. Dourado, Dieter Rautenbach, Jayme L. Szwarcfiter -- Locally-maximal embeddings of graphs in orientable surfaces / Michal Kotrbčík, Martin Škoviera -- A characterization of triangulations of closed surfaces / Jorge Arocha, Javier Bracho, Natalia García-Colín, Isabel Hubard -- Quasi-perfect linear codes from singular plane cubics / Massimo Giulietti -- Boxicity and cubicity of product graphs / L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad -- Planarity -- Planar graphs with Δ ≥ 8 are (Δ + 1)-edge-choosable / Marthe Bonamy -- Planar emulators conjecture is nearly true for cubic graphs / Martin Derka, Petr Hliněný -- Random planar graphs with minimum degree two and three / Marc Noy, Lander Ramos -- Degenerated induced subgraphs of planar graphs / Robert Lukot’ka, Ján Mazák, Xuding Zhu -- Strong chromatic index of planar graphs with large girth / Mickaël Montassier, Arnaud Pêcher, André Raspaud -- On homomorphisms of planar signed graphs to signed projective cubes / Reza Naserasr, Edita Rollová, Éric Sopena -- Classification of k-nets embedded in a plane / Gábor Korchmáros -- An improved lower bound on the maximum number of non-crossing spanning trees / Clemens Huemer, Anna de Mier -- On the structure of graphs with large minimum bisection / Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz -- Colorings -- Coloring intersection graphs of arcwise connected sets in the plane / Michaƚ Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak -- A characterization of edge-reflection positive partition functions of vertex-coloring models / Guus Regts -- Adjacent vertex-distinguishing edge coloring of graphs / Marthe Bonamy, Nicolas Bousquet, Hervé Hocquard -- Rainbow path and minimum degree in properly edge colored graphs / Anita Das, P. Suresh, S. V. Subrahmanya -- B-Coloring Graphs with Girth at Least 8 / Victor Campos, Carlos Lima, Ana Silva -- The circular chromatic index of k-regular graphs / Barbora Candráková, Edita Máčajová -- Coloring d-Embeddable k-Uniform Hypergraphs / Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz -- Homomorphisms of signed bipartite graphs / Reza Naserasr, Edita Rollovâ, Éric Sopena -- Games -- A threshold for the Maker-Breaker clique game / Tobias Müller, Miloš Stojaković -- On the threshold bias in the oriented cycle game / Dennis Clemens, Anita Liebenau -- Building spanning trees quickly in Maker-Breaker games / Dennis Clemens, Asaf Ferber, Roman Glebov, Dan Hefetz, Anita Liebenau -- Dicots, and a taxonomic ranking for misère games / Paul Dorbec, Gabriel Renault, Aaron Siegel, Éric Sopena -- Avoider-Enforcer star games / Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman -- Algebra and Polynomials -- Fooling-sets and rank in nonzero characteristic / Mirjam Friesen, Dirk Oliver Theis -- Krasner near-factorizations and 1-overlapped factorizations / Tadashi Sakuma, Hidehiro Shinohara -- Correlation inequality for formal series / Vladimir Blinovsky -- Covariants of spherical Θ-orbits for types E 6, E 7, E 8 / Witold Kraśkiewicz, Jerzy Weyman -- Partition regularity of nonlinear polynomials: a nonstandard approach / Lorenzo Luperi Baglini -- Randomness -- Random subgraphs make identification affordable / Florent Foucaud, Guillem Perarnau, Oriol Serra -- On two-point configurations in subsets of pseudo-random sets / Elad Aigner-Horev, Hiệp Hàn -- On the giant component of random hyperbolic graphs / Michel Bode, Nikolaos Fountoulakis, Tobias Müller -- Discontinuous bootstrap percolation in power-law random graphs / Hamed Amini, Nikolaos Fountoulakis, Konstantinos Panagiotou -- On a conjecture of Graham and Häggkvist for random trees / Michael Drmota, Anna Lladó -- Sharp threshold functions via a coupling method / Katarzyna Rybarczyk -- Analytic description of the phase transition of inhomogeneous multigraphs / Élie de Panafieu, Vlady Ravelomanana -- Fixed-point -- On the Bruhat-Chevalley order on fixed-point-free involutions / Mahir Bilen Can, Yonah Cherniavsky, Tim Twelbeck -- A geometric approach to combinatorial fixed-point theorems: extended abstract / Elyot Grant, Will Ma -- Hamiltonicity -- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments / Daniela Kühn, John Lapinskas, Deryk Osthus, Viresh Patel -- Proof of the 1-factorization and Hamilton decomposition conjectures / Béla Csaba, Daniela Kühn, Allan Lo, Deryk Osthus, Andrew Treglown -- Regular hypergraphs: asymptotic counting and loose Hamilton cycles / Andrzej Dudek, Alan Frieze, Andrzej Ruciński, Matas Šileikis -- Triangles -- Dynamic concentration of the triangle-free process / Tom Bohman, Peter Keevash -- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 / Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec -- Henneberg steps for triangle representations / Nieke Aerts, Stefan Felsner -- Cycles and Girth of Graphs -- Cycle-continuous mappings -- order structure / Robert Šámal -- On the structure of graphs with given odd girth and large minimum degree / Silvia Messuti, Mathias Schacht -- On the order of cages with a given girth pair / Julian Salas, Camino Balbuena -- Enumerations, Lattices and Tableaux -- Enumerations, Lattices and Tableaux / -- Directed and multi-directed animals on the King’s lattice / Axel Bacher -- Results and conjectures on the number of standard strong marked tableaux / Susanna Fishel, Matjaž Konvalinka -- On independent transversals in matroidal Latin rectangles / Ron Aharoni, Daniel Kotlar, Ran Ziv -- Multivariate Lagrange inversion formula and the cycle lemma / Axel Bacher, Gilles Schaeffer -- Combinatorics and algorithms -- Simplifying inclusion, exclusion formulas / Xavier Goaoc, Jiří Matoušek, Pavel Paták, Zuzana Safernová, Martin Tancer -- Majority and plurality problems / Dániel Gerbner, Gyula O. H. Katona, Dömötör Pålvölgyi, Balázs Patkós -- Combinatorial bounds on relational complexity / David Hartman, Jan Hubička, Jaroslav Nešetřil -- A combinatorial approach to colourful simplicial depth / Antoine Deza, Frédéric Meunier, Pauline Sarrabezolles -- Complexity and approximation of the smallest k-enclosing ball problem / Vladimir Shenmaier -- Testing uniformity of stationary distribution / Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap -- On a covering problem in the hypercube / Lale Özkahya, Brendon Stanton -- A classification of positive posets using isotropy groups of Dynkin diagrams / Marcin Ga̧siorek, Daniel Simson -- Posters -- Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method / Raúl M. Falcón -- Polynomial graph invariants from homomorphism numbers / Delia Garijo, Andrew J. Goodall, Jaroslav Nešetřil -- An Erdős-Ko-Rado theorem for matchings in the complete graph / Vikram Kamat, Neeldhara Misra -- A constrained path decomposition of cubic graphs and the path number of cacti / Fábio Botler, Yoshiko Wakabayashi -- On push chromatic number of planar graphs and planar p-cliques / Sagnik Sen -- Firefighting with general weights / Vitor Costa, Simone Dantas, Mitre C. Dourado, Lucia D. Penso, Dieter Rautenbach -- Nowhere-zero flows on signed regular graphs / Eckhard Steffen, Michael Schubert -- New transience bounds for long walks in weighted digraphs / Bernadette Charron-Bost, Matthias Függer, Thomas Nowak -- Complexity of determining the irregular chromatic index of a graph / Julien Bensmail -- Index. |
| Altri titoli varianti | EuroComb 2013 |
| Record Nr. | UNINA-9910438136803321 |
| Pisa : , : Scuola Normale Superiore : , : Imprint : Edizioni della Normale, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||