Combinatorics Probability and Computing
| 短名 | Combinator. Probab. Comp. |
| Journal Impact | 0.92 |
| 国际分区 | STATISTICS & PROBABILITY(Q3) |
| 期刊索引 | SCI Q2中科院 4 区 |
| ISSN | 0963-5483, 1469-2163 |
| h-index | 56 |
| 国内分区 | 数学(4区)数学统计学与概率论(3区)数学计算机理论方法(4区)数学数学(4区) |
双月刊出版的《组合数学、概率与计算》致力于组合数学、概率论和理论计算机科学三个领域。涵盖的主题包括经典和代数图论、极值集理论、拟阵理论、概率方法和随机组合结构；随机组合结构的组合概率和极限定理；算法理论（包括复杂性理论）、随机算法、算法概率分析、计算学习理论和优化。
期刊主页投稿网址| 涉及主题 | 数学组合数学计算机科学离散数学物理数学分析理论计算机科学图形量子力学程序设计语言纯数学工程类哲学统计几何学 |
| 出版信息 | 出版商: Cambridge University Press，出版周期: Bimonthly，期刊类型: journal |
| 基本数据 | 创刊年份: 1992，原创研究文献占比: 100.00%，自引率:11.10%， Gold OA占比: 35.23% |
| 平均审稿周期 | 网友分享经验：较慢,6-12周 |
| 平均录用比例 | 网友分享经验：容易 |
期刊引文格式
这些示例是对学术期刊文章的引用，以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章，因此这些字段是可选的。有些电子期刊不提供页面范围，而是列出文章标识符。在这种情况下，使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用，以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
Counting spanning subgraphs in dense hypergraphs
2024-5-30
A generalisation of Varnavides’s theorem
2024-5-29
Noise sensitivity of the minimum spanning tree of the complete graph
2024-5-23
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
2024-5-13
Maximum chordal subgraphs of random graphs
2024-5-3
Central limit theorem for components in meandric systems through high moments
2024-4-29
Turán problems in pseudorandom graphs
2024-4-29
Behaviour of the minimum degree throughout the -process
2024-4-22
A generalization of Bondy’s pancyclicity theorem
2024-4-17
The distribution of the maximum protection number in simply generated trees
2024-4-12
Algorithms for the ferromagnetic Potts model on expanders
2024-4-5
Antidirected subgraphs of oriented graphs
2024-3-6
A class of graphs of zero Turán density in a hypercube
2024-3-5
Sharp bounds for a discrete John’s theorem
2024-3-5
Large monochromatic components in expansive hypergraphs
2024-3-5
Small subsets with large sumset: Beyond the Cauchy–Davenport bound
2024-2-21
On a conjecture of Conlon, Fox, and Wigderson
2024-2-16
Percolation on irregular high-dimensional product graphs
2023-12-20
Product structure of graph classes with bounded treewidth
2023-12-7
On minimum spanning trees for random Euclidean bipartite graphs
2023-11-30
Threshold graphs maximise homomorphism densities
2023-11-29
Spread-out limit of the critical points for lattice trees and lattice animals in dimensions
2023-11-20
Large cliques or cocliques in hypergraphs with forbidden order-size pairs
2023-11-16
The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution
2023-11-16
Spanning trees in graphs without large bipartite holes
2023-11-14
Approximate discrete entropy monotonicity for log-concave sums
2023-11-13
A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree
2023-11-10
Mastermind with a linear number of queries
2023-11-8
On oriented cycles in randomly perturbed digraphs
2023-11-8
On the choosability of -minor-free graphs
2023-11-3
Spanning subdivisions in Dirac graphs
2023-10-20
Intersecting families without unique shadow
2023-10-2
Many Hamiltonian subsets in large graphs with given density
2023-10-2
The Excluded Tree Minor Theorem Revisited
2023-9-27
On the zeroes of hypergraph independence polynomials
2023-9-21
Height function localisation on trees
2023-9-18
On the size of maximal intersecting families
2023-9-8
Forcing generalised quasirandom graphs efficiently
2023-9-5
Quasipolynomial-time algorithms for Gibbs point processes
2023-8-11
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph
2023-7-31
On the exponential growth rates of lattice animals and interfaces
2023-7-31
On the maximum number of edges in -critical graphs
2023-7-24
Polarised random -SAT
2023-7-20
The codegree Turán density of tight cycles minus one edge
2023-7-5
On the size-Ramsey number of grids
2023-6-26
Archaeology of random recursive dags and Cooper-Frieze random networks
2023-6-13
On the number of error correcting codes
2023-6-9
Unimodular random one-ended planar graphs are sofic
2023-6-9
Spanning -cycles in random graphs
2023-6-9
A smoother notion of spread hypergraphs
2023-6-8
帮你贴心管理全部的文献
研飞ivySCI，高效的论文管理
投稿经验分享
分享我的经验，帮你走得更远