Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 26 (2019)
Précédent
Suivant
Sommaire du
Fascicule no. 1
On a positivity conjecture in the character table of \(S_n\)
Sheila Sundaram
Latin cubes with forbidden entries
Carl Johan Casselgren
;
Klas Markström
;
Lan Anh Pham
On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
Hemanshu Kaul
;
Jeffrey A. Mudrock
Rainbow matchings in properly-colored hypergraphs
Hao Huang
;
Tong Li
;
Guanghui Wang
Chromatic-choosability of hypergraphs with high chromatic number
Wei Wang
;
Jianguo Qian
Staircases to analytic sum-sides for many new integer partition identities of Rogers-Ramanujan type
Shashank Kanade
;
Matthew C. Russell
On Cartesian products which determine few distinct distances
Cosmin Pohoata
More Turán-type theorems for triangles in convex point sets
Boris Aronov
;
Vida Dujmović
;
Pat Morin
;
Aurélien Ooms
;
Luı́s Fernando Schultz Xavier da Silveira
On the generalized spectral characterizations of Eulerian graphs
Lihong Qiu
;
Yizhe Ji
;
Wei Wang
A cornucopia of quasi-Yamanouchi tableaux
George Wang
Equidistributed statistics on Fishburn matrices and permutations
Dandan Chen
;
Sherry H.F. Yan
;
Robin D.P. Zhou
On some interesting ternary formulas
Pascal Ochem
;
Matthieu Rosenfeld
A bijection for essentially 4-connected toroidal triangulations
Nicolas Bonichon
;
Benjamin Lévêque
The overgraphs of generalized cospectral controllable graphs
Alexander Farrugia
Algebraically grid-like graphs have large tree-width
Daniel Weißauer
The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)
Klavdija Kutnar
;
Dragan Marušič
;
Štefko Miklavič
;
Primož Šparl
On the rainbow Turán number of paths
Beka Ergemlidze
;
Ervin Győri
;
Abhishek Methuku
The game of plates and olives
Teena Carroll
;
David Galvin
Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
Shoham Letzter
Combinatorics of exceptional sequences in type A
Alexander Garver
;
Kiyoshi Igusa
;
Jacob P. Matherne
;
Jonah Ostroff
Total distance, Wiener index and opportunity index in wreath products of star graphs
Matteo Cavaleri
;
Alfredo Donno
;
Andrea Scozzari
Regularity and \(h\)-polynomials of edge ideals
Takayuki Hibi
;
Kazunori Matsuda
;
Adam Van Tuyl
Tree-like distance colouring for planar graphs of sufficient girth
Ross J. Kang
;
Willem van Loon
The canonical join complex
Emily Barnard
Dual graded graphs and Bratteli diagrams of towers of groups
Christian Gaetz
Improved bounds on the multicolor Ramsey numbers of paths and even cycles
Charlotte Knierim
;
Pascal Su
Permutations of type \(B\) with fixed number of descents and minus signs
Katarzyna Kril
;
Wojciech Młotkowski
The Tu-Deng conjecture holds almost surely
Lukas Spiegelhofer
;
Michael Wallner
Antichain toggling and rowmotion
Michael Joseph
Minimum number of additive tuples in groups of prime order
Ostap Chervak
;
Oleg Pikhurko
;
Katherine Staden
Continuants, run lengths, and Barry's modified Pascal triangle
Lukas Spiegelhofer
;
Jeffrey Shallit
Classification of external zonotopal algebras
Gleb Nenashev
Decomposing graphs into a spanning tree, an even graph, and a star forest
Kasper Szabo Lyngsie
;
Martin Merker
On the Turán density of \(\{1, 3\}\)-hypergraphs
Shuliang Bai
;
Linyuan Lu
Classifying rotationally-closed languages having greedy universal cycles
Joseph DiMuro
The chromatic number of finite group Cayley tables
Luis Goddyn
;
Kevin Halasz
;
E. S. Mahmoodian
A bijection between necklaces and multisets with divisible subset sum
Swee Hong Chan
Ehrhart polynomial roots of reflexive polytopes
Gábor Hegedüs
;
Akihiro Higashitani
;
Alexander Kasprzyk
Polyhedra with few 3-cuts are Hamiltonian
G. Brinkmann
;
C. T. Zamfirescu
The cd-indices of intervals in the uncrossing partial order on matchings
Younghwan Kim
Composability of permutation classes
Mark Karpilovskij
Perfect matching covers of cubic graphs of oddness 2
Wuyang Sun
;
Fan Wang
Cubic graphs with small independence ratio
József Balogh
;
Alexandr Kostochka
;
Xujun Liu
On the maximum density of fixed strongly connected subtournaments
Leonardo N. Coregliano
;
Roberto F. Parente
;
Cristiane M. Sato
Opportunity costs in the game of best choice
Madeline Crews
;
Brant Jones
;
Kaitlyn Myers
;
Laura Taalman
;
Michael Urbanski
;
Breeann Wilson
Topology of \(\mathbb{Z}_3\)-equivariant Hilbert schemes
Deborah Castro
;
Dustin Ross
Flow polytopes of partitions
Karola Mészáros
;
Connor Simpson
;
Zoe Wellner
Enumeration on row-increasing tableaux of shape \(2 \times n\)
Rosena R.X. Du
;
Xiaojie Fan
;
Yue Zhao
On the Möbius function and topology of general pattern posets
Jason P. Smith
The chromatic number of the \(q\)-Kneser graph for large \(q\)
Ferdinand Ihringer
On generalized choice and coloring numbers
Zdenēk Dvořák
;
Jakub Pekárek
;
Jean-Sébastien Sereni
On the real-rootedness of the local \(h\)-polynomials of edgewise subdivisions
Philip B. Zhang
On degree properties of crossing-critical families of graphs
Drago Bokal
;
Mojca Bračič
;
Marek Derňár
;
Petr Hliněný
Sommaire du
Fascicule no. 2
Permutations in two dimensions that maximally separate neighbors
Mohammed Albow
;
Jeffrey Edgington
;
Mario Lopez
;
Petr Vojtěchovský
Axioms for shifted tableau crystals
Maria Gillespie
;
Jake Levinson
On the subnet prune and regraft distance
Jonathan Klawitter
;
Simone Linz
Homotopy type of the neighborhood complexes of graphs of maximal degree at most 3 and 4-regular circulant graphs
Samir Shukla
The ascent-plateau statistics on Stirling permutations
Shi-Mei Ma
;
Jun Ma
;
Yeong-Nan Yeh
On certain edge-transitive bicirculants
Robert Jajcay
;
Štefko Miklavič
;
Primož Šparl
;
Gorazd Vasiljević
A geometric interpretation of the intertwining number
Mahir Bilen Can
;
Yonah Cherniavsky
;
Martin Rubey
Inglenook shunting puzzles
Simon R. Blackburn
On the lattice point covering problem in dimension 2
Fei Xue
An upper bound for the regularity of symbolic powers of edge ideals of chordal graphs
Seyed Amin Seyed Fakhari
Extremal \(H\)-free planar graphs
Yongxin Lan
;
Yongtang Shi
;
Zi-Xia Song
Shell tableaux: a set partition analog of vacillating tableaux
Megan Ly
Stability results for vertex Turán problems in Kneser graphs
Dániel Gerbner
;
Abhishek Methuku
;
Dániel T. Nagy
;
Balazs Patkos
;
Máté Vizer
On almost-equidistant sets. II
Alexandr Polyanskii
On monochromatic pairs of nondecreasing diameters
Adam O'Neal
;
Michael W. Schroeder
Vertically constrained Motzkin-like paths inspired by bobbin lace
Veronika Irvine
;
Stephen Melczer
;
Frank Ruskey
Vizing's 2-factor conjecture involving toughness and maximum degree conditions
Jinko Kanno
;
Songling Shan
On the maximum degree of path-pairable planar graphs
António Girão
;
Gábor Mészáros
;
Kamil Popielarz
;
Richard Snyder
Toric mutations in the \(\mathrm{dp}_2\) quiver and subgraphs of the \(\mathrm{dp}_2\) brane tiling
Yibo Gao
;
Zhaoqi Li
;
Thuy-Duong Vuong
;
Lisa Yang
Extensions of set partitions and permutations
Jhon B. Caicedo
;
Victor H. Moll
;
José L. Ramírez
;
Diego Villamizar
Off-diagonal ordered Ramsey numbers of matchings
Dhruv Rohatgi
Monochromatic Hilbert cubes and arithmetic progressions
József Balogh
;
Mikhail Lavrov
;
George Shakan
;
Adam Zsolt Wagner
Lattice homomorphisms between weak orders
Nathan Reading
On resilience of connectivity in the evolution of random graphs
Luc Haller
;
Miloš Trujić
Independence number of graphs with a prescribed number of cliques
Tom Bohman
;
Dhruv Mubayi
Phase measurement of quantum walks: application to structure theorem of the positive support of the Grover walk
Norio Konno
;
Iwao Sato
;
Etsuo Segawa
Super RSK correspondence with symmetry
Robert Muth
Cyclic Demazure modules and positroid varieties
Thomas Lam
The smallest strictly Neumaier graph and its generalisations
Rhys J. Evans
;
Sergey Goryainov
;
Dmitry Panasenko
The perimeter and site-perimeter of set partitions
Toufik Mansour
Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
James D. Currie
;
Lucas Mol
;
Narad Rampersad
The rise-contact involution on Tamari intervals
Viviane Pons
Combinatorial cluster expansion formulas from triangulated surfaces
Toshiya Yurikusa
Structure and supersaturation for intersecting families
József Balogh
;
Shagnik Das
;
Hong Liu
;
Maryam Sharifzadeh
;
Tuan Tran
Classification of the hyperovals in \(\mathrm{PG}(2,64)\)
Peter Vandendriessche
Many triangles with few edges
Rachel Kirsch
;
A. J. Radcliffe
A splitter theorem for 3-connected 2-polymatroids
James Oxley
;
Charles Semple
;
Geoff Whittle
A note on counting flows in signed graphs
Matt DeVos
;
Edita Rollová
;
Robert Šámal
Clumsy packings of graphs
Maria Axenovich
;
Anika Kaufmann
;
Raphael Yuster
Fractional \(L\)-intersecting families
Niranjan Balachandran
;
Rogers Mathew
;
Tapas Kumar Mishra
Non-bipartite distance-regular graphs with a small smallest eigenvalue
Zhi Qiao
;
Yifan Jing
;
Jack Koolen
Split graphs: combinatorial species and asymptotics
Justin M. Troyka
Rigid linkages and partial zero forcing
Daniela Ferrero
;
Mary Flagg
;
H. Tracy Hall
;
Leslie Hogben
;
Jephian C.-H. Lin
;
Seth A. Meyer
;
Shahla Nasserasr
;
Bryan Shader
The second eigenvalue of some normal Cayley graphs of highly transitive groups
Xueyi Huang
;
Qiongxiang Huang
;
Sebastian M. Cioabă
On a conjecture regarding identification in Hamming graphs
Ville Junnila
;
Tero Laihonen
;
Tuomo Lehtilä
Sommaire du
Fascicule no. 3
Matching complexes of small grids
Takahiro Matsushita
Domino tilings for augmented Aztec rectangles and their chains
Hyunggi Kim
;
Sangyop Lee
;
Seungsang Oh
Improved bounds for the extremal number of subdivisions
Oliver Janzer
Rigidity for the Hopf algebra of quasisymmetric functions
Wanwan Jia
;
Zhengpan Wang
;
Houyi Yu
Fundamental domains for rhombic lattices with dihedral symmetry of order 8
Joseph Ray Clarence G. Damasco
;
Dirk Frettlöh
;
Manuel Joseph C. Loquias
The size of the giant component in random hypergraphs: a short proof
Oliver Cooley
;
Mihyun Kang
;
Christoph Koch
Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs
Toshiaki Omori
;
Hisashi Naito
;
Tatsuya Tate
Non-monochromatic triangles in a 2-edge-coloured graph
Matt DeVos
;
Jessica McDonald
;
Amanda Montejano
Some identities involving second kind Stirling numbers of types \(B\) and \(D\)
Eli Bagno
;
Riccardo Biagioli
;
David Garber
On graph-theoretical invariants of combinatorial manifolds
Alberto Cavicchioli
;
Fulvia Spaggiari
Generalized coinvariant algebras for \(G(r,1,n)\) in the Stanley-Reisner setting
Daniël Kroes
Bootstrap percolation in directed inhomogeneous random graphs
Thilo Meyer-Brandis
;
Nils Detering
;
Konstantinos Panagiotou
Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences
Nicholas R. Beaton
;
Mathilde Bouvel
;
Veronica Guerrini
;
Simone Rinaldi
Uglov bipartitions and extended Young diagrams
Nicolas Jacon
The spectrum of group-based complete Latin squares
M. A. Ollis
;
Christopher R. Tripp
On the spectral characterization of mixed extensions of \(P_3\)
Willem H. Haemers
;
Sezer Sorgun
;
Hatice Topcu
On grounded \(\llcorner\)-graphs and their relatives
Vít Jelínek
;
Martin Töpfer
Decomposing 1-Sperner hypergraphs
Endre Boros
;
Vladimir Gurvich
;
Martin Milanič
Subdivisions in digraphs of large out-degree or large dichromatic number
Pierre Aboulker
;
Nathann Cohen
;
Frédéric Havet
;
William Lochet
;
Phablo F. S. Moura
;
Stéphan Thomassé
Two partial orders for standard Young tableaux
Justyna Kosakowska
;
Markus Schmidmeier
;
Hugh Thomas
The problem of pawns
Tricia Muldoon Brown
Smirnov trees
Matjaž Konvalinka
;
Vasu Tewari
A coupling of the spectral measures at a vertex
Thibault Espinasse
;
Paul Rochet
VC dimension and a union theorem for set systems
Stijn Cambie
;
António Girão
;
Ross J. Kang
Greene-Kleitman invariants for Sulzgruber insertion
Alexander Garver
;
Rebecca Patrias
On partially ordered patterns of length 4 and 5 in permutations
Alice L. L. Gao
;
Sergey Kitaev
Hopping from Chebyshev polynomials to permutation statistics
Jordan O. Tirrell
;
Yan Zhuang
New probabilistic upper bounds on the domination number of a graph
Nader Jafari Rad
Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
Mark Dukes
;
Thomas Selig
;
Jason P. Smith
;
Einar Steingrímsson
2-colorability of \(r\)-uniform hypergraphs
Michael Krul
;
Luboš Thoma
On walks avoiding a quadrant
Kilian Raschel
;
Amélie Trotignon
On the stability and instability of finite dynamical systems with prescribed interaction graphs
Maximilien Gadouleau
Baxter posets
Emily Meehan
Simplicial complexes are game complexes
Sara Faridi
;
Svenja Huntemann
;
Richard J. Nowakowski
\(1/k\)-Eulerian polynomials and \(k\)-inversion sequences
Ting-Wei Chao
;
Jun Ma
;
Shi-Mei Ma
;
Yeong-Nan Yeh
A note on log-concave random graphs
Alan Frieze
;
Tomasz Tkocz
Flow polynomials of a signed graph
Xiangyu Ren
;
Jianguo Qian
Partitioning the power set of \([n]\) into \(C_k\)-free parts
Eben Blaisdell
;
András Gyárfás
;
Robert A. Krueger
;
Ronen Wdowinski
Johnson type bounds for mixed dimension subspace codes
Thomas Honold
;
Michael Kiermaier
;
Sascha Kurz
Maximum number of colourings: 5-chromatic case
Fiachra Knox
;
Bojan Mohar
Limiting probabilities for vertices of a given rank in 1-2 trees
Miklós Bóna
;
István Mező
Quandles of cyclic type with several fixed points
António Lages
;
Pedro Lopes
Relating ordinary and fully simple maps via monotone Hurwitz numbers
Gaëtan Borot
;
Séverin Charbonnier
;
Norman Do
;
Elba Garcia-Failde
Monomial ideals of weighted oriented graphs
Yuriko Pitones
;
Enrique Reyes
;
Jonathan Toledo
Spectral lower bounds for the orthogonal and projective ranks of a graph
Pawel Wocjan
;
Clive Elphick
Dependencies among dependencies in matroids
James Oxley
;
Suijie Wang
A new encoding of permutations by Laguerre histories
Sherry H.F. Yan
;
Hao Zhou
;
Zhicong Lin
The new dinv is not so new
Michele D'Adderio
;
Alessandro Iraci
Lattices from tight frames and vertex transitive graphs
Lenny Fukshansky
;
Deanna Needell
;
Josiah Park
;
Yuxin Xin
Coordinate deletion of zeroes
Eero Räty
Classes of graphs with \(e\)-positive chromatic symmetric function
Angèle M. Foley
;
Chính T. Hoàng
;
Owen D. Merkel
Support equalities among ribbon Schur functions
Marisa Gaetz
;
Will Hardt
;
Shruthi Sridhar
Exact solution of some quarter plane walks with interacting boundaries
N. R. Beaton
;
A. L. Owczarek
;
A. Rechnitzer
Structure of cubic Lehman matrices
Dillon Mayhew
;
Irene Pivotto
;
Gordon Royle
Chromatic polynomials of oriented graphs
Danielle Cox
;
Christopher Duffy
Spanning trails in a 2-connected graph
Shipeng Wang
;
Liming Xiong
A continuous analogue of lattice path enumeration
Quang-Nhat Le
;
Sinai Robins
;
Christophe Vignat
;
Tanay Wakhare
Families of major index distributions: closed forms and unimodality
William J. Keith
Difference families, skew Hadamard matrices, and critical groups of doubly regular tournaments
Venkata Raghu Tej Pantangi
Multicolour bipartite Ramsey number of paths
Matija Bucic
;
Shoham Letzter
;
Benny Sudakov
Balanced triangulations on few vertices and an implementation of cross-flips
Lorenzo Venturello
Resolving two conjectures on staircase encodings and boundary grids of \(132\) and \(123\)-avoiding permutations
Shyam Sivasathya Narayanan
On the sweep map for \(\vec{k}\)-Dyck paths
Guoce Xin
;
Yingrui Zhang
On orthogonal symmetric chain decompositions
Karl Däubel
;
Sven Jäger
;
Torsten Mütze
;
Manfred Scheucher
Sommaire du
Fascicule no. 4
Statistical properties of lambda terms
Maciej Bendkowski
;
Olivier Bodini
;
Sergey Dovgal
Universality for random surfaces in unconstrained genus
Thomas Budzinski
;
Nicolas Curien
;
Bram Petri
Fractional domination game
Csilla Bujtas
;
Zsolt Tuza
Combinatorial specifications for juxtapositions of permutation classes
Robert Brignall
;
Jakub Sliačan
Vertex degree sums for matchings in 3-uniform hypergraphs
Yi Zhang
;
Yi Zhao
;
Mei Lu
The toucher-isolator game
Chris Dowden
;
Mihyun Kang
;
Mirjana Mikalački
;
Miloš Stojaković
On the weight of Berge-\(F\)-free hypergraphs
Sean English
;
Dániel Gerbner
;
Abhishek Methuku
;
Cory Palmer
Generalised Mycielski graphs and the Borsuk-Ulam theorem
Tobias Müller
;
Matěj Stehlík
Planar Ramsey graphs
Maria Axenovich
;
Ursula Schade
;
Carsten Thomassen
;
Torsten Ueckerdt
Collapsibility of simplicial complexes of hypergraphs
Alan Lew
Saturation games for odd cycles
Sam Spiro
On the rank of a random binary matrix
Colin Cooper
;
Alan Frieze
;
Wesley Pegden
An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)
Alex Cameron
Shellability of posets of labeled partitions and arrangements defined by root systems
Emanuele Delucchi
;
Noriane Girard
;
Giovanni Paolini
Aperiodic two-dimensional words of small abelian complexity
Svetlana Puzynina
The cyclic sieving phenomenon on circular Dyck paths
Per Alexandersson
;
Svante Linusson
;
Samu Potka
When is the \(q\)-multiplicity of a weight a power of \(q\)?
Pamela E. Harris
;
Margaret Rahmoeller
;
Lisa Schneider
;
Anthony Simpson
Position sequences and a \(q\)-analogue for the modular hook length formula
Anthony Mendes
;
Sam Lindbloom-Airey
Pentagonal subdivision
Min Yan
Distributed coloring in sparse graphs with fewer colors
Pierre Aboulker
;
Marthe Bonamy
;
Nicolas Bousquet
;
Louis Esperet
A note on the connectivity of 2-polymatroid minors
Zachary Gershkoff
;
James Oxley
Permutational powers of a graph
Matteo Cavaleri
;
Daniele D'Angeli
;
Alfredo Donno
Combining extensions of the Hales-Jewett theorem with Ramsey theory in other structures
Neil Hindman
;
Dona Strauss
;
Luca Q. Zamboni
Cyclic triangle factors in regular tournaments
Lina Li
;
Theodore Molla
The Gorenstein property for projective coordinate rings of the moduli of parabolic \(\mathrm{SL}_2\)-principal bundles on a smooth curve
Theodore Faust
;
Christopher Manon
Choice functions in the intersection of matroids
Joseph Briggs
;
Minki Kim
The biclique covering number of grids
Krystal Guo
;
Tony Huynh
;
Marco Macchia
Uniform generation of spanning regular subgraphs of a dense graph
Pu Gao
;
Catherine Greenhill
On the twelve-point theorem for \(\ell\)-reflexive polygons
Dimitrios I. Dais
Homomesy in products of three chains and multidimensional recombination
Corey Vorland
On 2-connected hypergraphs with no long cycles
Zoltán Füredi
;
Alexandr Kostochka
;
Ruth Luo
A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function
Claude Tardif
;
Xuding Zhu
Fractional factors, component factors and isolated vertex conditions in graphs
Roger Yu
;
Mikio Kano
;
Hongliang Lu
Tamari lattices for parabolic quotients of the symmetric group
Henri Mühle
;
Nathan Williams
A limit theorem for the six-length of random functional graphs with a fixed degree sequence
Kevin Leckey
;
Nick Wormald
Distinguishing graphs of maximum valence 3
Svenja Hüning
;
Wilfried Imrich
;
Judith Kloas
;
Hannah Schreber
;
Thomas W. Tucker
Connected chord diagrams and bridgeless maps
Julien Courtiel
;
Karen Yeats
;
Noam Zeilberger
Matching polytons
Martin Doležal
;
Jan Hladký
Crystals, semistandard tableaux and cyclic sieving phenomenon
Young-Tak Oh
;
Euiyong Park
Ramsey numbers of Berge-hypergraphs and related structures
Nika Salia
;
Casey Tompkins
;
Zhiyu Wang
;
Oscar Zamora
Fractional decompositions and the smallest-eigenvalue separation
Fiachra Knox
;
Bojan Mohar
The maximum number of cycles in a graph with fixed number of edges
Andrii Arman
;
Sergei Tsaturian
Cutting resilient networks -- complete binary trees
Xing Shi Cai
;
Cecilia Holmgren
Nearly neighbourly families of standard boxes
Jacek Bojarski
;
Andrzej Piotr Kisielewicz
;
Krzysztof Przesławski
Domination of the rectangular queen's graph
Sándor Bozóki
;
Péter Gál
;
István Marosi
;
William D. Weakley
Canonical forms for dihedral and symmetric groups
Robert Shwartz
Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels
Bernhard Gittenberger
;
Isabella Larcher
A new bijection between RNA secondary structures and plane trees and its consequences
Ricky Xiaofeng Chen
Nearly-regular hypergraphs and saturation of Berge stars
Bethany Austhof
;
Sean English
On the Schur function expansion of a symmetric quasi-symmetric function
Ira M. Gessel
The weighted Davenport constant of a group and a related extremal problem
Niranjan Balachandran
;
Eshita Mazumdar
Cumulative subtraction games
Gal Cohensius
;
Urban Larsson
;
Reshef Meir
;
David Wahlstedt
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
Shuya Chiba
;
Michitaka Furuya
;
Kenta Ozeki
;
Masao Tsugaki
;
Tomoki Yamashita
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
Padraig Condon
;
Alberto Espuny Díaz
;
Daniela Kühn
;
Deryk Osthus
;
Jaehoon Kim