Advances in Combinatorics

Rose McCarty

Decomposing a Signed Graph into Rooted Circuits

将带符号图分解为有根回路

By analogy with recent Work of Andrews on smallest parts in partitions of integers, we consider smallest parts in compositions (ordered partitions) of integers. In particular, we study the number of smallest parts and the sum of smallest parts in compositions of n as well as the position of the first smallest part in a random composition of n.

Arnold Knopfmacher

Augustine O. Munagi

Smallest Parts in Compositions

组合中的最小部分

Aviezri S. Fraenkel

Beating Your Fractional Beatty Game Opponent and: What’s the Question to Your Answer?

击败你的分数Beatty游戏对手及：你的答案对应的问题是什么？

Wadim Zudilin

Lost in Translation

迷失在翻译中

Christian Krattenthaler

Thomas W. Müller

Cyclic Sieving for Generalised Non-crossing Partitions Associated with Complex Reflection Groups of Exceptional Type

循环筛法在例外型复反射群相关广义非交叉分区的应用

Bogdan Alecu

Maria Chudnovsky

Sepehr Hajebi

Sophie Spirkl

Induced subgraphs and tree decompositions XIII. Basic obstructions in H-free graphs for finite H

诱导子图与树分解 XIII。有限 H 的 H-free 图中的基本障碍

Romain Bourneuf

Linda Cook

James Davies

On polynomial degree-boundedness

关于多项式度有界性

Samuel Braunfeld

David Chodounský

Noé de Rancourt

Jan Hubička

Jamal Kawach

Matěj Konečný

Big Ramsey degrees and infinite languages

大拉姆齐度与无限语言

In a ground-breaking paper solving a conjecture of Erdős on the number of n-vertex graphs not containing a given even cycle, Morris and Saxton [45] made a broad conjecture on so-called balanced supersaturation property of a bipartite graph H. Ferber, McKinley, and Samotij [29] established a weaker version of this conjecture and applied it to derive far-reaching results on the enumeration problem of H-free graphs.In this paper, we show that Morris and Saxton's conjecture holds under a very mild assumption about H, which is widely believed to hold whenever H contains a cycle.We then use our theorem to obtain enumeration results and general upper bounds on the Turán number of a bipartite H in the random graph G(n, p), the latter being the first of its kind.

Tao Jiang

Sean Longbrake

Balanced supersaturation and Turán numbers in random graphs

随机图中的平衡过饱和与Turán数

Publication Information	Publisher: Alliance of Diamond OA Journals，Publishing cycle: ，Journal Type: journal，Open Access Journals: Yes
Basic data	Year of publication: 2019，Proportion of original research papers: 0.00%，Self Citation Rate:N.A.， Gold OA Rate: 0.00%
Average review cycle	30 weeks

Advances in Combinatorics

Journal Citation Format

A journal article with 1 author

A journal article with 2 authors

A journal article with 3 authors

A journal article with 5 or more authors

Books Citation Format

Thesis Citation Format

Web sites Citation Format

Patent Citation Format

Staying up late manually editing references? ivySCI automatically matches journals and helps you generate references with a single click.

Share Submission Experience

Decomposing a Signed Graph into Rooted Circuits

Smallest Parts in Compositions

Beating Your Fractional Beatty Game Opponent and: What’s the Question to Your Answer?

Lost in Translation

Cyclic Sieving for Generalised Non-crossing Partitions Associated with Complex Reflection Groups of Exceptional Type

Decomposing a Signed Graph into Rooted Circuits

Induced subgraphs and tree decompositions XIII. Basic obstructions in H-free graphs for finite H

On polynomial degree-boundedness

Big Ramsey degrees and infinite languages

Balanced supersaturation and Turán numbers in random graphs

ISSN	2517-5599
h-index	7