Previous Issue|Next Issue
Export Citation(s)Download PDF(s)

ISSUE INFORMATION

Free Access

Issue Information

  • Pages: 1-3
  • First Published: 24 November 2020

IN MEMORIAM

In Memoriam

  • Page: 5
  • First Published: 24 November 2020

ARTICLES

Open Access

Partitions of hypergraphs under variable degeneracy constraints

Thomas Schweser,  Michael Stiebitz, 
  • Pages: 7-33
  • First Published: 05 May 2020

On the maximum number of copies of H in graphs with given size and order

Dániel Gerbner,  Dániel T. Nagy,  Balázs Patkós,  Máté Vizer, 
  • Pages: 34-43
  • First Published: 02 April 2020
Open Access

Random walk hitting times and effective resistance in sparsely connected Erdős-Rényi random graphs

John Sylvester, 
  • Pages: 44-84
  • First Published: 17 February 2020

Order plus size of τ-critical graphs

András Gyárfás,  Jenő Lehel, 
  • Pages: 85-86
  • First Published: 26 June 2020

Finding any given 2-factor in sparse pseudorandom graphs efficiently

Jie Han,  Yoshiharu Kohayakawa,  Patrick Morris,  Yury Person, 
  • Pages: 87-108
  • First Published: 05 May 2020

List Ramsey numbers

Noga Alon,  Matija Bucić,  Tom Kalvari,  Eden Kuperwasser,  Tibor Szabó, 
  • Pages: 109-128
  • First Published: 27 June 2020

The Ramsey numbers of two sets of cycles

Longqin Wang,  Yaojun Chen, 
  • Pages: 129-136
  • First Published: 30 March 2020

Proper-walk connection number of graphs

Jørgen Bang-Jensen,  Thomas Bellitto,  Anders Yeo, 
  • Pages: 137-159
  • First Published: 30 June 2020

On induced subgraphs of the Hamming graph

Dingding Dong, 
  • Pages: 160-166
  • First Published: 27 October 2020