Results 91 to 100 of about 2,700,684 (210)
On Rainbow Turán Densities of Trees
Random Structures &Algorithms, Volume 66, Issue 3, May 2025.ABSTRACT For a given collection 𝒢=(G1,…,Gk) of graphs on a common vertex set V$$ V $$, which we call a graph system, a graph H$$ H $$ on a vertex set V(H)⊆V$$ V(H)\subseteq V $$ is called a rainbow subgraph of 𝒢 if there exists an injective function ψ:E(H)→[k]$$ \psi :E(H)\to \left[k\right] $$ such that e∈Gψ(e)$$ e\in {G}_{\psi (e)} $$ for each e∈E(H)$$
Seonghyuk Im +3 more
wiley +1 more source
The many faces of alternating-sign matrices [PDF]
"Discrete Models: Combinatorics, Computation, and Geometry"
(special issue of Discrete Mathematics and Theoretical Computer Science),
July 2001, 2002 I give a survey of different combinatorial forms of alternating-sign matrices, starting with the original form introduced by Mills, Robbins and Rumsey as well as corner-sum matrices, height-function matrices, three-colorings, monotone triangles, tetrahedral order ideals, square ice, gasket-and-basket tilings and full packings of loops.
arxiv
Restart Perturbations for Reversible Markov Chains: Trichotomy and Pre‐Cutoff Equivalence
Random Structures &Algorithms, Volume 66, Issue 3, May 2025.ABSTRACT Given a reversible Markov chain Pn$$ {P}_n $$ on n$$ n $$ states, and another chain P˜n$$ {\tilde{P}}_n $$ obtained by perturbing each row of Pn$$ {P}_n $$ by at most αn$$ {\alpha}_n $$ in total variation, we study the total variation distance between the two stationary distributions, ‖πn−π˜n‖$$ \left\Vert {\pi}_n-{\tilde{\pi}}_n\right\Vert $$.
Daniel Vial, Vijay Subramanian
wiley +1 more source
The Distribution of Ramsey Numbers [PDF]
Advances and Applications in Discrete Mathematics vol. 14, pp.
67-74 (2014), 2013 We prove that the number of integers in the interval [0,x] that are non-trivial Ramsey numbers r(k,n) (3 <= k <= n) has order of magnitude (x ln x)**(1/2).
arxiv
A sufficient condition for first order non-definability of arrowing problems [PDF]
arXiv, 2012 We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf's Theorem and known concepts in finite combinatorics, like senders and determiners.
arxiv
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Set Matrices and The Path/Cycle Problem [PDF]
arXiv, 2007 Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.
arxiv
Directed Width Parameters and Circumference of Digraphs [PDF]
arXiv, 2014 We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.
arxiv
APPLICATION OF COMBINATORICS IN DISCRETE MATHEMATICS AND ALGORITHMS
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
Perfect Reconstruction of Oncogenetic Trees [PDF]
arXiv, 2012 In this note we provide the necessary and sufficient conditions to uniquely reconstruct an oncogenetic tree.
arxiv