COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are- Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups).- Combinatorial optimization.- Combinatorial aspects of geometry and number theory.- Algorithms in combinatorics and related fields.- Computational complexity theory.- Randomization and explicit construction in combinatorics and algorithms.
COMBINATORICA发表英文研究论文,涉及组合学和计算理论的各个领域,特别强调一般技术和统一原则。COMBINATORICA所涵盖的典型但非排他性的主题是-组合结构(图,超图,拟阵,设计,置换群)。组合优化。几何和数论的组合方面。组合学及相关领域的算法。计算复杂性理论。组合学与算法中的随机化与显式构造。
Defective Colouring of Graphs Excluding A Subgraph or Minor
来源期刊:CombinatoricaDOI:10.1007/s00493-018-3733-1
A Unified Erdős–Pósa Theorem for Constrained Cycles
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3683-z
Profiles of Separations: in Graphs, Matroids, and Beyond
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3595-y
Diameter of Ramanujan Graphs and Random Cayley Graphs
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3605-0
Long Cycles in Locally Expanding Graphs, with Applications
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3701-1
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3661-5
All Graphs Have Tree-Decompositions Displaying Their Topological Ends
来源期刊:CombinatoricaDOI:10.1007/s00493-018-3572-0
Ramsey Graphs Induce Subgraphs of Many Different Sizes
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3755-0
Long Cycles have the Edge-Erdős-Pósa Property
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3669-x
The Number of Triple Systems Without Even Cycles
来源期刊:CombinatoricaDOI:10.1007/S00493-018-3765-6
Asymptotic Metric Behavior of Random Cayley Graphs of Finite Abelian Groups
来源期刊:CombinatoricaDOI:10.1007/S00493-017-3672-2
The Minimally Non-Ideal Binary Clutters with a Triangle
来源期刊:CombinatoricaDOI:10.1007/S00493-018-3708-2
Matchings Extend into 2-Factors in Hypercubes
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3731-8
Tverberg Partitions as Weak Epsilon-Nets
来源期刊:CombinatoricaDOI:10.1007/S00493-018-3912-0
Local Properties in Colored Graphs, Distinct Distances, and Difference Sets
来源期刊:CombinatoricaDOI:10.1007/S00493-018-3890-2
Reflection on the Coloring and Chromatic Numbers
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3741-6
Tverberg-Type Theorems for Matroids: A Counterexample and a Proof
来源期刊:CombinatoricaDOI:10.1007/s00493-018-3846-6
Colorful Coverings of Polytopes and Piercing Numbers of Colorful d-Intervals
来源期刊:CombinatoricaDOI:10.1007/s00493-018-3891-1
Efficient Removal Without Efficient Regularity
来源期刊:CombinatoricaDOI:10.1007/s00493-018-3899-6
A Characterization of the Graphs of Bilinear (d×d)-Forms over $$\\mathbb{F}_2$$
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3573-4
Twenty (Short) Questions
来源期刊:CombinatoricaDOI:10.1007/S00493-018-3803-4
The Probability of Generating the Symmetric Group
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3629-5
Partitioning Subgraphs of Profinite Ordered Graphs
来源期刊:CombinatoricaDOI:10.1007/S00493-018-3479-9
Optimal Littlewood-Offord Inequalities in Groups
来源期刊:CombinatoricaDOI:10.1007/s00493-018-3845-7
On the Size of K-Cross-Free Families
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3792-8
Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs
来源期刊:CombinatoricaDOI:10.1007/S00493-015-2653-6
VC-Dimensions of Short Presburger Formulas
来源期刊:CombinatoricaDOI:10.1007/s00493-018-4004-x
On Finitary Hindman Numbers
来源期刊:CombinatoricaDOI:10.1007/S00493-019-4002-7
The Two-Point Fano and Ideal Binary Clutters
来源期刊:CombinatoricaDOI:10.1007/S00493-018-3779-0
Simultaneous Linear Discrepancy for Unions of Intervals
来源期刊:CombinatoricaDOI:10.1007/s00493-017-3769-7
List Supermodular Coloring with Shorter Lists
来源期刊:CombinatoricaDOI:10.1007/s00493-018-3830-1
The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers
来源期刊:CombinatoricaDOI:10.1007/S00493-017-3474-6