Cantitate/Preț
Produs
Total produse
Vezi coșul
Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications de Jaroslav Nešetřil

Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications: Trends in Mathematics, cartea 14

Editat de Jaroslav Nešetřil, Guillem Perarnau, Juanjo Rué, Oriol Serra
en Limba Engleză Paperback – 24 aug 2021
This book collects the extended abstracts of the accepted contributions to EuroComb21. A similar book is published at every edition of EuroComb (every two years since 2001) collecting the most recent advances in combinatorics, graph theory, and related areas.  It has a wide audience in the areas, and the papers are used and referenced broadly.
Citește tot Restrânge

Din seria Trends in Mathematics

  • 18% Advances in Ring Theory
    Preț: 93822 lei
  • 15% Advances in Commutative Algebra: Dedicated to David F. Anderson
    Preț: 63354 lei
  • 18% The Art of Doing Algebraic Geometry
    Preț: 78049 lei
  • Geometric Group Theory: Geneva and Barcelona Conferences
    Preț: 33558 lei
  • 15% Abelian Groups and Modules: International Conference in Dublin, August 10–14, 1998
    Preț: 63866 lei
  • 18% Ring and Module Theory
    Preț: 92198 lei
  • Stochastic Analysis and Mathematical Physics: ANESTOC ’98 Proceedings of the Third International Workshop
    Preț: 38092 lei
  • 20% Advances in Applied Analysis
    Preț: 56564 lei
  • Bifurcation, Symmetry and Patterns
    Preț: 38525 lei
  • 15% Algebraic Cycles, Sheaves, Shtukas, and Moduli: Impanga Lecture Notes
    Preț: 63273 lei
  • Analysis and Geometry in Several Complex Variables: Proceedings of the 40th Taniguchi Symposium
    Preț: 38241 lei
  • 15% Infinite Length Modules
    Preț: 58044 lei
  • 15% Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities
    Preț: 57596 lei
  • 15% Stochastic Processes and Related Topics: In Memory of Stamatis Cambanis 1943-1995
    Preț: 58351 lei
  • 18% Recent Progress in Intersection Theory
    Preț: 93340 lei
  • 24% Complex Analysis
    Preț: 80673 lei
  • 15% International Symposium on Ring Theory
    Preț: 58111 lei
  • Microlocal Methods in Mathematical Physics and Global Analysis
    Preț: 37335 lei
  • 18% Fractals in Graz 2001: Analysis — Dynamics — Geometry — Stochastics
    Preț: 72034 lei
  • Trends in Singularities
    Preț: 38544 lei
  • Real and Stochastic Analysis: New Perspectives
    Preț: 38731 lei
  • Affine Flag Manifolds and Principal Bundles
    Preț: 38187 lei
  • 15% Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities
    Preț: 64668 lei
  • 15% Advances in Analysis and Geometry: New Developments Using Clifford Algebras
    Preț: 64234 lei
  • 18% Mathematical Finance: Workshop of the Mathematical Finance Research Project, Konstanz, Germany, October 5–7, 2000
    Preț: 93913 lei
  • 20% Modules and Comodules
    Preț: 58392 lei
  • 24% Combinatorial and Geometric Group Theory: Dortmund and Ottawa-Montreal conferences
    Preț: 80297 lei
  • 15% Algorithmic Problems in Groups and Semigroups
    Preț: 63418 lei
  • 20% Real and Complex Singularities: São Carlos Workshop 2004
    Preț: 58505 lei
  • 18% Analysis and Mathematical Physics
    Preț: 94858 lei
  • 15% A Tribute to C.S. Seshadri: A Collection of Articles on Geometry and Representation Theory
    Preț: 64763 lei
  • 15% Hypercomplex Analysis and Applications
    Preț: 63336 lei
  • 18% Differential Equations with Symbolic Computation
    Preț: 93866 lei
  • Stochastic Analysis and Mathematical Physics II: 4th International ANESTOC Workshop in Santiago, Chile
    Preț: 38844 lei
  • Symbolic-Numeric Computation
    Preț: 39787 lei
  • 15% Notions of Positivity and the Geometry of Polynomials
    Preț: 63595 lei
  • 15% Control and Modeling of Complex Systems: Cybernetics in the 21st Century Festschrift in Honor of Hidenori Kimura on the Occasion of his 60th Birthday
    Preț: 63721 lei
  • 18% Geometric Methods in Physics: XXX Workshop, Białowieża, Poland, June 26 to July 2, 2011
    Preț: 93743 lei
  • 15% Advances in Ring Theory
    Preț: 57532 lei
  • 15% Concentration Analysis and Applications to PDE: ICTS Workshop, Bangalore, January 2012
    Preț: 62729 lei
  • Algebra: Some Recent Advances
    Preț: 37826 lei
  • 15% Statistics in Genetics and in the Environmental Sciences
    Preț: 62889 lei
  • Hyperbolic Problems and Regularity Questions
    Preț: 38111 lei
  • 15% C*-algebras and Elliptic Theory
    Preț: 63882 lei
  • 18% Multiscale Methods in Quantum Mechanics: Theory and Experiment
    Preț: 93017 lei
  • 18% Quaternion and Clifford Fourier Transforms and Wavelets
    Preț: 98694 lei
  • 15% Further Developments in Fractals and Related Fields: Mathematical Foundations and Connections
    Preț: 63242 lei
  • 18% Fundamental Problematic Issues in Turbulence
    Preț: 94066 lei

Preț: 111217 lei

Preț vechi: 135631 lei
-18% Nou

Puncte Express: 1668
Preț estimativ în valută:
21285€ • 22109$ • 17680£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030838225
ISBN-10: 3030838226
Ilustrații: XVI, 858 p. 118 illus., 51 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.2 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Birkhäuser
Seriile Trends in Mathematics, Research Perspectives CRM Barcelona

Locul publicării:Cham, Switzerland

Cuprins

Size of local finite field Kakeya sets.- Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length.- Nested cycles with no geometric crossings.- Cut vertices in random planar graphs.- Extremal density for sparse minors and subdivisions.- Enumerating descents on quasi-Stirling permutations and plane trees.- Hamiltonicity of randomly perturbed graphs.- The largest hole in sparse random graphs.- On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees.- Local convergence of random planar graphs.- Some results on the Laplacian spectra of token graphs.- On the Number of Compositions of Two Polycubes.- Halin's end degree conjecture.- Coloring Circle Arrangements: New 4-Chromatic Planar Graphs.- A Short Proof of Euler–Poincaré Formula.- Approximate MDS Property of Linear Codes.- A SAT attack on higher dimensional Erd\H{o}s--Szekeres numbers.- Improved bounds on the cop number of a graph drawn on a surface.- Stability of Berge-hypergraphs]{Stability of extremal connected hypergraphs avoiding Berge-paths, (extended abstract).- On tangencies among planar curves]{On tangencies among planar curves with an application to coloring L-shapes.- Semi-random process without replacement.- The intersection spectrum of 3-chromatic intersecting hypergraphs.- On ordered Ramsey numbers of tripartite 3-uniform hypergraphs.- Hypergraphs with minimum positive uniform Turan density.- Rainbow cliques in randomly perturbed dense graphs.- Universal singular exponents in catalytic variable equations.- The expected number of perfect matchings in cubic planar graphs.- Gallai-Ramsey number for complete graphs.- On the dichromatic number of surfaces.- Supersaturation, counting, and randomness inforbidden subposet problems.- Path decompositions of tournaments.- Sorting by shuffling methods and a queue.- Circular coloring of signed bipartite planar graphs.- Results on the Graceful Game and Range-Relaxed Graceful Game.- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs.- On Bipartite Sum Basic Equilibria.- Characterization and enumeration of preimages under the Queuesort algorithm.- On off-diagonal ordered Ramsey numbers of nested matchings.- Bounds on half graph orders in powers of sparse graphs.- The homotopy type of the independence complex of graphs with no induced cycles of length divisible by $3$.- The Maximum Number of Paths of Length Three in a Planar Graph.- Strongly Pfaffian Graphs.- Strong modeling limits of graphs with bounded tree-width.- Loose cores and cycles in random hypergraphs (extended abstract).- Building a larger class of graphs for efficient reconfiguration of vertex colouring.- A refinement of Cauchy-Schwarz complexity, with applications (extended abstract).- The Ising antiferromagnet in the replica symmetric phase.- A simple (2+\epsilon)-approximation algorithm for Split Vertex Deletion.- On graphs without an induced path on 5 vertices and without an induced dart or kite.- Constant congestion brambles in directedgraphs.- Component behaviour of random bipartite graphs.- Maximising line subgraphs of diameter at most $t$.- Unavoidable hypergraphs.- $2$-distance $(\Delta+1)$-coloring of sparse graphs using the potential method.- Graphs where Search Methods are Indistinguishable.- Discrete Helly-type theorems for pseudohalfplanes.- Cycles of Many Lengths in Hamiltonian Graphs.- Maximal $k$-wise $\ell$-divisible set families are atomic.- A Trivariate Dichromate Polynomial for Digraphs.- Schur's Theorem for randomly perturbed sets.- Unit Disk Visibility Graphs.- Waiter-Client Games on Randomly Perturbed Graphs.- Vector Choosability in Bipartite Graphs.- Tight bounds on the expected number of holes in random point sets.- The game of Toucher and Isolator.- Hermitian rank-metric codes.- The Flat Wall Theorem for Bipartite Graphs with Perfect Matchings.- Big Ramsey degrees and forbidden cycles.- The Ramsey number for 4-uniform tight cycles.- Chip-firing on the complete split graph: Motzkin words and tiered parking functions.- Long shortest cycle covers in cubic graphs.- Powers of Hamilton cycles of high discrepancy are unavoidable.- Low Diameter Algebraic Graphs.- The fractional chromatic number of double cones over graphs.- Complexity of $3+1/m$-coloring $P_t$-free graphs.- Shattering Threshold for the Coloring Problem of a Random Hypergraph.- Integer covering problems and max-norm Ramsey theorems.- Unit disks hypergraphs are three-colorable.- Characterization of FS-double Squares Ending with Two Distinct Squares.- On asymmetric hypergraphs.- On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs.- Max Cuts in Triangle-free Graphs.- On the cycle rank conjecture about metric dimension and zero forcing number in graphs.- Tight bounds for powers of Hamilton cycles in tournaments.- On sufficient conditions for Hamiltonicity in dense graphs.- On the maximum number of weakly-rainbow-free edge-colorings.- Degree conditions for tight Hamilton cycles.- An Approximate Structure Theorem for Small Sumsets.- Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics.- On the enumeration of plane bipolar posets and transversal structures.- The characterization of graphs whose sandpile group has fixed number of generators.- Kissing number in non-Euclidean spaces of constant sectional curvature.- Decomposing cubic graphs with cyclic connectivity 5.- Dirac-type conditions for spanning bounded-degree hypertrees.- Outer 1-string graphs of girth at least five are 3-colorable.- The rainbow Turan number of even cycles.- Trees with few leaves in tournaments.- Uncommon systems of equations.- Exchange properties of finite set-systems.- On a question of Vera T. Sós about size forcing of graphons (extended abstract).- On Deeply Critical Oriented Cliques.- Big Ramsey degrees of the generic partial order.- The square of a Hamilton cycle in randomly perturbed graphs.- On extremal problems concerning the traces of sets.- The chromatic number of signedgraphs with bounded maximum average degree.- Maker--Breaker games with constraints.- Parallelisms of PG(3,5) with an automorphism group of order 25.- On Alternation, VC-dimension and k-fold Union of Sets.- Weak components of the directed conguration model.- Decomposing and Colouring Locally Out-Transitive Oriented Graphs.- Ramsey expansions of 3-hypertournaments.- Path decompositions of random directed graphs.- Large multipartite subgraphs in H-free graphs.- Kempe changes in bounded treewidth graphs.- No Selection Lemma for Empty Triangles.- The mod $k$ chromatic index of random graphs.- Constructions of betweenness-uniform graphs from trees.- On the homomorphism order of oriented paths and trees.- On chromatic number of (n, m)-graphs.- On  a problem of Füredi and Griggs.- Gallai's path decomposition for planar graphs.- Tuza's Conjecture for threshold graphs.- Covering three-tori with cubes.- New bounds on $k$-geodetic digraphs and mixed graphs.- Counting $C_k$-free orientationsof $G(n,p)$.- Counting Circuit Double Covers.- Oriented graphs with lower orientation Ramsey thresholds.- Random 2-cell embeddings of multistars.- Cycle saturation in random graphs.- On the maximum cut in sparse random hypergraphs.- Asymptotics for connected graphs and irreducible tournament.- Interval representation of balanced separators in graphs avoiding a minor.- Lines in the Manhattan plane.- A rainbow connectivity threshold for random graph families.- Robust Connectivity of Graphs on Surfaces.

Textul de pe ultima copertă

This book collects the extended abstracts of the accepted contributions to EuroComb21. A similar book is published at every edition of EuroComb (every two years since 2001) collecting the most recent advances in combinatorics, graph theory, and related areas.  It has a wide audience in the areas, and the papers are used and referenced broadly.

Caracteristici

Is published at every edition of EuroComb which is one of the leading conferences in the area worldwide Presents the most recent achievements in this conference Collects the extended abstracts of the accepted contributions to EuroComb21