Results 121 to 130 of about 221,378 (266)
Graphs with 4-Rainbow Index 3 and n − 1
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G),
Li Xueliang +3 more
doaj +1 more source
Algebraic and geometric methods in enumerative combinatorics [PDF]
arXiv, 2014 A survey written for the upcoming "Handbook of Enumerative Combinatorics".
arxiv
A Bayesian Proof of the Spread Lemma
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT A key set‐theoretic “spread” lemma has been central to two recent celebrated results in combinatorics: the recent improvements on the sunflower conjecture by Alweiss, Lovett, Wu, and Zhang; and the proof of the fractional Kahn–Kalai conjecture by Frankston, Kahn, Narayanan, and Park.
Elchanan Mossel +3 more
wiley +1 more source
The combinatorics of splittability
Annals of Pure and Applied Logic, 2004 Small ...
openaire +3 more sources
Journal of Mathematical Analysis and Applications, 1991 Journal of Mathematical Analysis and Applications ; 160 ; 2 ; 500 ...
S.K. Tan +3 more
openaire +2 more sources
Combinatorics of Chord Progressions [PDF]
, 2012 Color poster with text and diagrams.This study explored an overlap between combinatorics and music. The goal was to show chord progressions that are common to a specific collection of music, composer, or era.University of Wisconsin--Eau Claire Office of
Kiefer, Peter
core +1 more source
The many faces of modern combinatorics [PDF]
arXiv, 2015 This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including algebraic geometry), topology, probability theory, and theoretical computer science.
arxiv
Combinatorics of Type D Exceptional Sequences [PDF]
arXiv, 2020 Exceptional sequences are important sequences of quiver representations in the study of representation theory of algebras. They are also closely related to the theory of cluster algebras and the combinatorics of Coxeter groups. We combinatorially classify exceptional sequences of a family of type D Dynkin quivers, and we show how our model for ...
arxiv
A Jump of the Saturation Number in Random Graphs?
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT For graphs G$$ G $$ and F$$ F $$, the saturation number sat(G,F)$$ sat\left(G,F\right) $$ is the minimum number of edges in an inclusion‐maximal F$$ F $$‐free subgraph of G$$ G $$. In 2017, Korándi and Sudakov initiated the study of saturation in random graphs. They showed that for constant p∈(0,1)$$ p\in \left(0,1\right) $$, whp satG(n,p),Ks=(
Sahar Diskin +2 more
wiley +1 more source
Discrete Mathematics, 2002 AbstractDaniel Kleitman's many research contributions are surveyed, with emphasis on extremal hypergraph theory, asymptotic enumeration, and discrete geometry.
openaire +2 more sources