Results 11 to 20 of about 46,626 (239)
Cut Vertices in Random Planar Maps [PDF]
, 2023 The main goal of this paper is to determine the asymptotic behavior of the number X n of cut-vertices in random planar maps with n edges. It is shown that X n / n ¿ c in probability (for some explicit c > 0 ).
Benedikt Stufler +6 more
core +1 more source
Oriented diameter and rainbow connection number of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Xiaolong Huang +3 more
doaj +1 more source
Graph Theory and Additive Combinatorics
, 2023 Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics.
Yufei Zhao
semanticscholar +1 more source
Borel combinatorics of locally finite graphs [PDF]
BCC, 2020 We provide a gentle introduction, aimed at non-experts, to Borel combinatorics that studies definable graphs on topological spaces. This is an emerging field on the borderline between combinatorics and descriptive set theory with deep connections to many
O. Pikhurko
semanticscholar +1 more source
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
Advances in Materials, 2020 Artificial scent screening systems (known as electronic noses, E‐noses) have been researched extensively. A portable, automatic, and accurate, real‐time E‐nose requires both robust cross‐reactive sensing and fingerprint pattern recognition.
Lingling Guo +9 more
semanticscholar +1 more source
A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
Journal of Mathematical Cryptology, 2020 We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David +3 more
doaj +1 more source
Polynomial reconstruction of the matching polynomial
Electronic Journal of Graph Theory and Applications, 2015 The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex ...
Xueliang Li, Yongtang Shi, Martin Trinks
doaj +1 more source
On the Combinatorics of Cumulants
Journal of Combinatorial Theory, Series A, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gian-Carlo Rota, Jianhong Shen
openaire +1 more source
Topological Classification of Crystalline Insulators through Band Structure Combinatorics [PDF]
, 2016 We present a method for efficiently enumerating all allowed, topologically distinct, electronic band structures within a given crystal structure in all physically relevant dimensions. The algorithm applies to crystals without time-reversal, particle-hole,
J. Kruthoff +4 more
semanticscholar +1 more source