Results 101 to 110 of about 69,062 (214)

Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions

open access: yes, 2017
Boltzmann sampling is commonly used to uniformly sample objects of a particular size from large combinatorial sets. For this technique to be effective, one needs to prove that (1) the sampling procedure is efficient and (2) objects of the desired size ...
Bernstein, Megan   +2 more
core   +1 more source

Integer colorings with forbidden rainbow sums

open access: yes, 2020
For a set of positive integers $A \subseteq [n]$, an $r$-coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erd\H{o}s-Rothchild problem in the context of sum-free sets, which ...
Cheng, Yangyang   +4 more
core  

APPLICATION OF COMBINATORICS IN DISCRETE MATHEMATICS AND ALGORITHMS

open access: yes
Combinatorics, as a branch of discrete mathematics, studies combinatorial structures and methods of their analysis. Its core tools, such as permutations, combinations, and placements, play a key role in various fields, including algorithms, optimization, cryptography, and graph theory. In this article, we will look at how combinatorics is used to solve
openaire   +1 more source

Embedding large subgraphs into dense graphs

open access: yes, 2009
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core   +1 more source

Quasirandom Graphs and the Pantograph Equation. [PDF]

open access: yesAm Math Mon, 2021
Shapira A, Tyomkyn M.
europepmc   +1 more source

Home - About - Disclaimer - Privacy