36 research outputs found
THE ELECTRONIC JOURNAL OF COMBINATORICS (2014), DS1.14 References
and Computing 11. The results of 143 references depend on computer algorithms. The references are ordered alphabetically by the last name of the first author, and where multiple papers have the same first author they are ordered by the last name of the second author, etc. We preferred that all work by the same author be in consecutive positions. Unfortunately, this causes that some of the abbreviations are not in alphabetical order. For example, [BaRT] is earlier on the list than [BaLS]. We also wish to explain a possible confusion with respect to the order of parts and spelling of Chinese names. We put them without any abbreviations, often with the last name written first as is customary in original. Sometimes this is different from the citations in other sources. One can obtain all variations of writing any specific name by consulting the authors database of Mathematical Reviews a
Small Ramsey Numbers
We present data which, to the best of our knowledge, includes all known nontrivial values and bounds for specific graph, hypergraph and multicolor Ramsey numbers, where the avoided graphs are complete or complete without one edge. Many results pertaining to other more studied cases are also presented. We give references to all cited bounds and values, as well as to previous similar compilations. We do not attempt complete coverage of asymptotic behavior of Ramsey numbers, but concentrate on their specific values
On Size Bipartite and Tripartite Ramsey Numbers for The Star Forest and Path on 3 Vertices
For simple graphs G and H the size multipartite Ramsey number mj(G,H) is the smallest natural number t such that any arbitrary red-blue coloring on the edges of Kjxt contains a red G or a blue H as a subgraph. We studied the size tripartite Ramsey numbers m3(G,H) where G=mK1,n and H=P3. In this paper, we generalize this result. We determine m3(G,H) where G is a star forest, namely a disjoint union of heterogeneous stars, and H=P3. Moreover, we also determine m2(G,H) for this pair of graphs G and H
On Size Multipartite Ramsey Numbers for Stars Versus Paths and Cycles
Let be a complete, balanced, multipartite graph consisting of partite sets and vertices in each partite set. For given two graphs and , and integer , the size multipartite Ramsey number is the smallest integer such that every factorization of the graph satisfies the following condition: either contains or contains . In 2007, Syafrizal et al. determined the size multipartite Ramsey numbers of paths versus stars, for only. Furthermore, Surahmat et al. (2014) gave the size tripartite Ramsey numbers of paths versus stars, for . In this paper, we investigate the size tripartite Ramsey numbers of paths versus stars, with all . Our results complete the previous results given by Syafrizal et al. and Surahmat et al. We also determine the size bipartite Ramsey numbers of stars versus cycles, for
Advances in Discrete Applied Mathematics and Graph Theory
The present reprint contains twelve papers published in the Special Issue “Advances in Discrete Applied Mathematics and Graph Theory, 2021” of the MDPI Mathematics journal, which cover a wide range of topics connected to the theory and applications of Graph Theory and Discrete Applied Mathematics. The focus of the majority of papers is on recent advances in graph theory and applications in chemical graph theory. In particular, the topics studied include bipartite and multipartite Ramsey numbers, graph coloring and chromatic numbers, several varieties of domination (Double Roman, Quasi-Total Roman, Total 3-Roman) and two graph indices of interest in chemical graph theory (Sombor index, generalized ABC index), as well as hyperspaces of graphs and local inclusive distance vertex irregular graphs
Recommended from our members
Cliques in graphs
The main focus of this thesis is to evaluate , the minimal number of -cliques in graphs with vertices and minimum degree~. A fundamental result in Graph Theory states that a triangle-free graph of order has at most edges. Hence, a triangle-free graph has minimum degree at most , so if then . For , I have evaluated and determined the structures of the extremal graphs. For , I give a conjecture on , as well as the structures of these extremal graphs. Moreover, I have proved various partial results that support this conjecture. Let be the analogous version of for regular graphs. Notice that there exist and such that but . For example, a theorem of Andr{\'a}sfai, Erd{\H{o}}s and S{\'o}s states that any triangle-free graph of order with minimum degree greater than must be bipartite. Hence but for odd. I have evaluated the exact value for between and and determined the structure of these extremal graphs.
At the end of the thesis, I investigate a question in Ramsey Theory. The Ramsey number of a graph is the minimum number , such that any edge colouring of with colours contains a monochromatic copy of . The constrained Ramsey number of two graphs and is the minimum number such that any edge colouring of with any number of colours contains a monochromatic copy of or a rainbow copy of . It turns out that these two quantities are closely related when is a matching. Namely, for almost all graphs , for
Quantum-classical generative models for machine learning
The combination of quantum and classical computational resources towards more effective algorithms is one of the most promising research directions in computer science. In such a hybrid framework, existing quantum computers can be used to their fullest extent and for practical applications. Generative modeling is one of the applications that could benefit the most, either by speeding up the underlying sampling methods or by unlocking more general models. In this work, we design a number of hybrid generative models and validate them on real hardware and datasets. The quantum-assisted Boltzmann machine is trained to generate realistic artificial images on quantum annealers. Several challenges in state-of-the-art annealers shall be overcome before one can assess their actual performance. We attack some of the most pressing challenges such as the sparse qubit-to-qubit connectivity, the unknown effective-temperature, and the noise on the control parameters. In order to handle datasets of realistic size and complexity, we include latent variables and obtain a more general model called the quantum-assisted Helmholtz machine. In the context of gate-based computers, the quantum circuit Born machine is trained to encode a target probability distribution in the wavefunction of a set of qubits. We implement this model on a trapped ion computer using low-depth circuits and native gates. We use the generative modeling performance on the canonical Bars-and-Stripes dataset to design a benchmark for hybrid systems. It is reasonable to expect that quantum data, i.e., datasets of wavefunctions, will become available in the future. We derive a quantum generative adversarial network that works with quantum data. Here, two circuits are optimized in tandem: one tries to generate suitable quantum states, the other tries to distinguish between target and generated states