| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A bijective proof of the hook-length formula for skew shapes
|
Konvalinka, Matjaž
|
|
2017
|
61 |
C |
p. 765-771
|
artikel
|
| 2 |
Additive bases and flows in graphs
|
Esperet, Louis
|
|
2017
|
61 |
C |
p. 399-405
|
artikel
|
| 3 |
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
|
Bustamante, Sebastián
|
|
2017
|
61 |
C |
p. 185-190
|
artikel
|
| 4 |
A Local Epsilon Version of Reed's Conjecture
|
Kelly, Tom
|
|
2017
|
61 |
C |
p. 719-725
|
artikel
|
| 5 |
A Median-Type Condition for Graph Tiling
|
Piguet, Diana
|
|
2017
|
61 |
C |
p. 979-985
|
artikel
|
| 6 |
A minimum-change version of the Chung-Feller theorem for Dyck paths
|
Mütze, Torsten
|
|
2017
|
61 |
C |
p. 901-907
|
artikel
|
| 7 |
Anagram-free colorings of graphs
|
Kamčev, Nina
|
|
2017
|
61 |
C |
p. 671-677
|
artikel
|
| 8 |
An Asymptotic Scheme for Analysis of Expectations of Plane Partition Statistics
|
Mutafchiev, Ljuben
|
|
2017
|
61 |
C |
p. 893-899
|
artikel
|
| 9 |
A note on the maximum number of triangles in a C 5-free graph
|
Ergemlidze, Beka
|
|
2017
|
61 |
C |
p. 395-398
|
artikel
|
| 10 |
A simple approach for lower-bounding the distortion in any Hyperbolic embedding
|
Coudert, David
|
|
2017
|
61 |
C |
p. 293-299
|
artikel
|
| 11 |
A skew version of the Loebl–Komlós–Sós conjecture
|
Klimošová, Tereza
|
|
2017
|
61 |
C |
p. 743-749
|
artikel
|
| 12 |
A Tutte polynomial for non-orientable maps
|
Goodall, Andrew
|
|
2017
|
61 |
C |
p. 513-519
|
artikel
|
| 13 |
Automated Positive Part Extraction for Lattice Path Generating Functions in the Octant
|
Yatchak, Rika
|
|
2017
|
61 |
C |
p. 1061-1067
|
artikel
|
| 14 |
A word property for twisted involutions in Coxeter groups
|
Hansson, Mikael
|
|
2017
|
61 |
C |
p. 569-575
|
artikel
|
| 15 |
Bijections for walks ending on an axis, using open arc diagrams
|
Courtiel, Julien
|
|
2017
|
61 |
C |
p. 301-307
|
artikel
|
| 16 |
Boolean Dimension and Local Dimension
|
Trotter, William T.
|
|
2017
|
61 |
C |
p. 1047-1053
|
artikel
|
| 17 |
Burling graphs, chromatic number, and orthogonal tree-decompositions
|
Felsner, Stefan
|
|
2017
|
61 |
C |
p. 415-420
|
artikel
|
| 18 |
Characteristic polynomials of production matrices for geometric graphs
|
Huemer, Clemens
|
|
2017
|
61 |
C |
p. 631-637
|
artikel
|
| 19 |
Chi-boundedness of graph classes excluding wheel vertex-minors
|
Choi, Hojin
|
|
2017
|
61 |
C |
p. 247-253
|
artikel
|
| 20 |
Classification of empty lattice 4-simplices of width larger than 2
|
Iglesias Valiño, Óscar
|
|
2017
|
61 |
C |
p. 647-653
|
artikel
|
| 21 |
Co-Bipartite Neighborhood Edge Elimination Orderings
|
Jiamjitrak, Wanchote
|
|
2017
|
61 |
C |
p. 655-661
|
artikel
|
| 22 |
Coloring dense digraphs
|
Harutyunyan, Ararat
|
|
2017
|
61 |
C |
p. 577-583
|
artikel
|
| 23 |
Colorings of b-simple hypergraphs
|
Akhmejanova, Margarita
|
|
2017
|
61 |
C |
p. 29-35
|
artikel
|
| 24 |
Colouring squares of claw-free graphs
|
de Verclos, Rémi de Joannis
|
|
2017
|
61 |
C |
p. 663-669
|
artikel
|
| 25 |
Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
|
Lockhart, Joshua
|
|
2017
|
61 |
C |
p. 819-825
|
artikel
|
| 26 |
Combinatorial Problems on H-graphs
|
Chaplick, Steven
|
|
2017
|
61 |
C |
p. 223-229
|
artikel
|
| 27 |
Compatible Cycle Decomposition of bad K 5-minor-free graphs
|
Fleischner, Herbert
|
|
2017
|
61 |
C |
p. 445-449
|
artikel
|
| 28 |
Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture
|
Bessy, Stéphane
|
|
2017
|
61 |
C |
p. 115-121
|
artikel
|
| 29 |
Completing graphs to metric spaces
|
Aranda, Andrés
|
|
2017
|
61 |
C |
p. 53-60
|
artikel
|
| 30 |
Computing the number of realizations of a Laman graph
|
Capco, Jose
|
|
2017
|
61 |
C |
p. 207-213
|
artikel
|
| 31 |
Contracting Bipartite Graphs to Paths and Cycles
|
Dabrowski, Konrad K.
|
|
2017
|
61 |
C |
p. 309-315
|
artikel
|
| 32 |
Covering and tiling hypergraphs with tight cycles
|
Han, Jie
|
|
2017
|
61 |
C |
p. 561-567
|
artikel
|
| 33 |
Decomposing edge-colored graphs under color degree constraints
|
Fujita, Shinya
|
|
2017
|
61 |
C |
p. 491-497
|
artikel
|
| 34 |
Decomposing graphs into paths and trees
|
Klimošová, Tereza
|
|
2017
|
61 |
C |
p. 751-757
|
artikel
|
| 35 |
Decomposing tournaments into paths
|
Lo, Allan
|
|
2017
|
61 |
C |
p. 813-818
|
artikel
|
| 36 |
Decomposition of 8-regular graphs into paths of length 4
|
Botler, Fábio
|
|
2017
|
61 |
C |
p. 147-153
|
artikel
|
| 37 |
Density of Real Zeros of the Tutte Polynomial
|
Ok, Seongmin
|
|
2017
|
61 |
C |
p. 941-946
|
artikel
|
| 38 |
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
|
Patel, Viresh
|
|
2017
|
61 |
C |
p. 971-977
|
artikel
|
| 39 |
Directed Ramsey number for trees
|
Bucić, Matija
|
|
2017
|
61 |
C |
p. 169-175
|
artikel
|
| 40 |
Directed Random Walks on Polytopes with Few Facets
|
Milatz, Malte
|
|
2017
|
61 |
C |
p. 869-875
|
artikel
|
| 41 |
Distance colouring without one cycle length
|
Kang, Ross J.
|
|
2017
|
61 |
C |
p. 695-701
|
artikel
|
| 42 |
Dushnik-Miller dimension of contact systems of d-dimensional boxes
|
Francis, Mathew C.
|
|
2017
|
61 |
C |
p. 467-473
|
artikel
|
| 43 |
Edge-disjoint rainbow trees in properly coloured complete graphs
|
Pokrovskiy, Alexey
|
|
2017
|
61 |
C |
p. 995-1001
|
artikel
|
| 44 |
Embedding graphs in Euclidean space
|
Frankl, Nóra
|
|
2017
|
61 |
C |
p. 475-481
|
artikel
|
| 45 |
Embedding spanning bounded degree subgraphs in randomly perturbed graphs
|
Böttcher, Julia
|
|
2017
|
61 |
C |
p. 155-161
|
artikel
|
| 46 |
Enumerating Polyominoes with Fixed Perimeter Defect
|
Asinowski, Andrei
|
|
2017
|
61 |
C |
p. 61-67
|
artikel
|
| 47 |
Enumeration of labeled 4-regular planar graphs
|
Noy, Marc
|
|
2017
|
61 |
C |
p. 933-939
|
artikel
|
| 48 |
Equiangular lines and subspaces in Euclidean spaces
|
Balla, Igor
|
|
2017
|
61 |
C |
p. 85-91
|
artikel
|
| 49 |
Estimating the distance to a hereditary graph property
|
Hoppen, Carlos
|
|
2017
|
61 |
C |
p. 607-613
|
artikel
|
| 50 |
Evolution of the giant component in graphs on orientable surfaces
|
Kang, M.
|
|
2017
|
61 |
C |
p. 687-693
|
artikel
|
| 51 |
Exponentially many nowhere-zero Z 3 -, Z 4 -, and Z 6 -flows
|
Dvořák, Zdeněk
|
|
2017
|
61 |
C |
p. 375-381
|
artikel
|
| 52 |
Extremal Bounds for Bootstrap Percolation in the Hypercube
|
Morrison, Natasha
|
|
2017
|
61 |
C |
p. 877-883
|
artikel
|
| 53 |
Extremal graph theory and finite forcibility
|
Grzesik, Andrzej
|
|
2017
|
61 |
C |
p. 541-547
|
artikel
|
| 54 |
Fair representation in dimatroids
|
Aharoni, Ron
|
|
2017
|
61 |
C |
p. 5-11
|
artikel
|
| 55 |
Families with no matchings of size s
|
Frankl, Peter
|
|
2017
|
61 |
C |
p. 483-489
|
artikel
|
| 56 |
Finding strongly popular b-matchings in bipartite graphs
|
Király, Tamás
|
|
2017
|
61 |
C |
p. 735-741
|
artikel
|
| 57 |
First steps in combinatorial optimization on graphons: Matchings
|
Doležal, Martin
|
|
2017
|
61 |
C |
p. 359-365
|
artikel
|
| 58 |
Gaps in full homomorphism order
|
Fiala, Jiří
|
|
2017
|
61 |
C |
p. 429-435
|
artikel
|
| 59 |
Generalized primitivity of labeled digraphs
|
Gusev, Vladimir V.
|
|
2017
|
61 |
C |
p. 549-555
|
artikel
|
| 60 |
Generalizing Erdős, Moon and Moser's result — The number of k-dominating independent sets
|
Nagy, Zoltán Lóránt
|
|
2017
|
61 |
C |
p. 909-915
|
artikel
|
| 61 |
Grid Ramsey problem
|
Corsten, Jan
|
|
2017
|
61 |
C |
p. 287-292
|
artikel
|
| 62 |
Hamilton cycles in the line graph of a random graph
|
Rybarczyk, Katarzyna
|
|
2017
|
61 |
C |
p. 1027-1031
|
artikel
|
| 63 |
Homological connectedness of random hypergraphs
|
Cooley, Oliver
|
|
2017
|
61 |
C |
p. 279-285
|
artikel
|
| 64 |
Homomorphisms of Cayley graphs and Cycle Double Covers
|
Hušek, Radek
|
|
2017
|
61 |
C |
p. 639-645
|
artikel
|
| 65 |
Induced Ramsey-type results and binary predicates for point sets
|
Balko, Martin
|
|
2017
|
61 |
C |
p. 77-83
|
artikel
|
| 66 |
Irreducible 4-critical triangle-free toroidal graphs
|
Dvořák, Zdeněk
|
|
2017
|
61 |
C |
p. 383-389
|
artikel
|
| 67 |
K 4-expansions have the edge-Erdős-Pósa property
|
Bruhn, Henning
|
|
2017
|
61 |
C |
p. 163-168
|
artikel
|
| 68 |
Kneser ranks of random graphs and minimum difference representations
|
Füredi, Zoltán
|
|
2017
|
61 |
C |
p. 499-503
|
artikel
|
| 69 |
Lagrangians of hypergraphs: The Frankl-Füredi conjecture holds almost everywhere
|
Tyomkyn, Mykhaylo
|
|
2017
|
61 |
C |
p. 1055-1059
|
artikel
|
| 70 |
Lattice walks in the octant with infinite associated groups
|
Kauers, Manuel
|
|
2017
|
61 |
C |
p. 703-709
|
artikel
|
| 71 |
Linear quasi-randomness of subsets of abelian groups and hypergraphs
|
Aigner-Horev, Elad
|
|
2017
|
61 |
C |
p. 21-27
|
artikel
|
| 72 |
Loose Hamiltonian cycles forced by large (k −2)-degree - sharp version
|
de O. Bastos, J.
|
|
2017
|
61 |
C |
p. 101-106
|
artikel
|
| 73 |
Matching Connectivity: On the Structure of Graphs with Perfect Matchings
|
Giannopoulou, Archontia C.
|
|
2017
|
61 |
C |
p. 505-511
|
artikel
|
| 74 |
Minimum rainbow H-decompositions of graphs
|
Özkahya, Lale
|
|
2017
|
61 |
C |
p. 955-961
|
artikel
|
| 75 |
Modularity in several random graph models
|
Ostroumova Prokhorenkova, Liudmila
|
|
2017
|
61 |
C |
p. 947-953
|
artikel
|
| 76 |
Monochromatic paths in random tournaments
|
Bucić, Matija
|
|
2017
|
61 |
C |
p. 177-183
|
artikel
|
| 77 |
Monochromatic trees in random graphs
|
Kohayakawa, Y.
|
|
2017
|
61 |
C |
p. 759-764
|
artikel
|
| 78 |
On a Frankl–Rödl theorem and its geometric corollaries
|
Sagdeev, A.A.
|
|
2017
|
61 |
C |
p. 1033-1037
|
artikel
|
| 79 |
On a star chromatic index of subcubic graphs
|
Lužar, Borut
|
|
2017
|
61 |
C |
p. 835-839
|
artikel
|
| 80 |
On avoding r-repetitions in R 2
|
Dębski, Michal
|
|
2017
|
61 |
C |
p. 331-337
|
artikel
|
| 81 |
On complexity of multidistance graph recognition in R 1
|
Tikhomirov, Mikhail
|
|
2017
|
61 |
C |
p. 1039-1045
|
artikel
|
| 82 |
On Finding Some New Excluded Minors for Gammoids
|
Albrecht, Immanuel
|
|
2017
|
61 |
C |
p. 37-43
|
artikel
|
| 83 |
On Induced Colourful Paths in Triangle-free Graphs
|
Babu, Jasine
|
|
2017
|
61 |
C |
p. 69-75
|
artikel
|
| 84 |
On packing spanning arborescences with matroid constraint
|
Fortier, Quentin
|
|
2017
|
61 |
C |
p. 451-457
|
artikel
|
| 85 |
On quadrangulations and Stokes complexes
|
Bateni, Amir-Hossein
|
|
2017
|
61 |
C |
p. 107-113
|
artikel
|
| 86 |
On Star Decompositions of Random Regular Graphs
|
Delcourt, Michelle
|
|
2017
|
61 |
C |
p. 339-342
|
artikel
|
| 87 |
On subgraphs of C 2k -free graphs
|
Grósz, Dániel
|
|
2017
|
61 |
C |
p. 521-526
|
artikel
|
| 88 |
On the difference between hamilton cycles and 2-factors with a prescribed number of cycles
|
Chiba, Shuya
|
|
2017
|
61 |
C |
p. 239-245
|
artikel
|
| 89 |
On the inducibility of cycles
|
Hefetz, Dan
|
|
2017
|
61 |
C |
p. 593-599
|
artikel
|
| 90 |
On the List Coloring Version of Reed's Conjecture
|
Delcourt, Michelle
|
|
2017
|
61 |
C |
p. 343-349
|
artikel
|
| 91 |
On the Local Approach to Sidorenko's Conjecture
|
Fox, Jacob
|
|
2017
|
61 |
C |
p. 459-465
|
artikel
|
| 92 |
On the number of edge-disjoint triangles in K 4-free graphs
|
Győri, Ervin
|
|
2017
|
61 |
C |
p. 557-560
|
artikel
|
| 93 |
On the number of r-transitive orientations of G(n,p)
|
Collares, M.
|
|
2017
|
61 |
C |
p. 255-261
|
artikel
|
| 94 |
On the structure constants of the descent algebra of the hyperoctahedral group
|
Mayorova, Alina R.
|
|
2017
|
61 |
C |
p. 847-853
|
artikel
|
| 95 |
On the Turán number of ordered forests
|
Korándi, Dániel
|
|
2017
|
61 |
C |
p. 773-779
|
artikel
|
| 96 |
On universal partial words
|
Chen, Herman Z.Q.
|
|
2017
|
61 |
C |
p. 231-237
|
artikel
|
| 97 |
Packing and covering odd cycles in cubic plane graphs with small faces
|
Nicodemos, Diego
|
|
2017
|
61 |
C |
p. 925-931
|
artikel
|
| 98 |
Packing arborescences in random digraphs
|
Hoppen, Carlos
|
|
2017
|
61 |
C |
p. 615-621
|
artikel
|
| 99 |
Packing degenerate graphs greedily
|
Allen, Peter
|
|
2017
|
61 |
C |
p. 45-51
|
artikel
|
| 100 |
Packing two graphs of even girth 10
|
Cames van Batenburg, Wouter
|
|
2017
|
61 |
C |
p. 191-197
|
artikel
|
| 101 |
Pairwise intersecting homothets of a convex body
|
Polyanskii, Alexandr
|
|
2017
|
61 |
C |
p. 1003-1009
|
artikel
|
| 102 |
Panchromatic 3-coloring of a random hypergraph
|
Kravtsov, Dmitry
|
|
2017
|
61 |
C |
p. 781-787
|
artikel
|
| 103 |
Partition functions from orthogonal and symplectic group invariants
|
Regts, G.
|
|
2017
|
61 |
C |
p. 1011-1017
|
artikel
|
| 104 |
Pebble Games and Cospectral Graphs
|
Dawar, Anuj
|
|
2017
|
61 |
C |
p. 323-329
|
artikel
|
| 105 |
Pentagon Contact Representations
|
Felsner, Stefan
|
|
2017
|
61 |
C |
p. 421-427
|
artikel
|
| 106 |
Permutrees
|
Pilaud, Vincent
|
|
2017
|
61 |
C |
p. 987-993
|
artikel
|
| 107 |
Preface
|
Drmota, Michael
|
|
2017
|
61 |
C |
p. 1-3
|
artikel
|
| 108 |
Proof of Komlós's conjecture on Hamiltonian subsets
|
Kim, Jaehoon
|
|
2017
|
61 |
C |
p. 727-733
|
artikel
|
| 109 |
Quasirandomness in hypergraphs
|
Aigner-Horev, Elad
|
|
2017
|
61 |
C |
p. 13-19
|
artikel
|
| 110 |
Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree
|
Cano, Pilar
|
|
2017
|
61 |
C |
p. 199-205
|
artikel
|
| 111 |
Ramsey theorem for designs
|
Hubička, Jan
|
|
2017
|
61 |
C |
p. 623-629
|
artikel
|
| 112 |
Random Strategies are Nearly Optimal for Generalized van der Waerden Games
|
Kusch, C.
|
|
2017
|
61 |
C |
p. 789-795
|
artikel
|
| 113 |
Resilience for the Littlewood-Offord Problem
|
Bandeira, Afonso S.
|
|
2017
|
61 |
C |
p. 93-99
|
artikel
|
| 114 |
Shellable posets arising from the even subgraphs of a graph
|
Park, Boram
|
|
2017
|
61 |
C |
p. 963-969
|
artikel
|
| 115 |
Some properties of the skeleton of the pyramidal tours polytope
|
Bondarenko, Vladimir
|
|
2017
|
61 |
C |
p. 131-137
|
artikel
|
| 116 |
Spectral Bisection with Two Eigenvectors
|
Rocha, Israel
|
|
2017
|
61 |
C |
p. 1019-1025
|
artikel
|
| 117 |
Stability of extremal hypergraphs with applications to an edge-coloring problem
|
de Oliveira Contiero, Lucas
|
|
2017
|
61 |
C |
p. 263-269
|
artikel
|
| 118 |
Staircases, dominoes, and the growth rate of 1324-avoiders
|
Bevan, David
|
|
2017
|
61 |
C |
p. 123-129
|
artikel
|
| 119 |
Standard Monomials and Extremal Vector Systems
|
Mészáros, Tamás
|
|
2017
|
61 |
C |
p. 855-861
|
artikel
|
| 120 |
Sticky matroids and Kantor's Conjecture
|
Hochstättler, Winfried
|
|
2017
|
61 |
C |
p. 601-606
|
artikel
|
| 121 |
Supersaturation Problem for the Bowtie
|
Kang, Mihyun
|
|
2017
|
61 |
C |
p. 679-685
|
artikel
|
| 122 |
Symmetric Complete Sum-free Sets in Cyclic Groups
|
Haviv, Ishay
|
|
2017
|
61 |
C |
p. 585-591
|
artikel
|
| 123 |
ν-Tamari lattices via subword complexes
|
Ceballos, Cesar
|
|
2017
|
61 |
C |
p. 215-221
|
artikel
|
| 124 |
The codegree threshold of K 4 −
|
Falgas-Ravry, Victor
|
|
2017
|
61 |
C |
p. 407-413
|
artikel
|
| 125 |
The evolution of random graphs on surfaces
|
Dowden, Chris
|
|
2017
|
61 |
C |
p. 367-373
|
artikel
|
| 126 |
The Expansion of a Chord Diagram and the Tutte Polynomial
|
Nakamigawa, Tomoki
|
|
2017
|
61 |
C |
p. 917-923
|
artikel
|
| 127 |
The Interactive Sum Choice Number of Graphs
|
Bonamy, Marthe
|
|
2017
|
61 |
C |
p. 139-145
|
artikel
|
| 128 |
The Junta Method in Extremal Hypergraph Theory and Chvátal's Conjecture
|
Keller, Nathan
|
|
2017
|
61 |
C |
p. 711-717
|
artikel
|
| 129 |
The minimum number of triangles in graphs of given order and size
|
Liu, Hong
|
|
2017
|
61 |
C |
p. 805-811
|
artikel
|
| 130 |
The structure and the number of P 7-free bipartite graphs
|
Lozin, Vadim
|
|
2017
|
61 |
C |
p. 827-833
|
artikel
|
| 131 |
Threshold functions for small subgraphs: an analytic approach
|
Collet, Gwendal
|
|
2017
|
61 |
C |
p. 271-277
|
artikel
|
| 132 |
Tight bounds on the coefficients of partition functions via stability
|
Davies, Ewan
|
|
2017
|
61 |
C |
p. 317-321
|
artikel
|
| 133 |
Tiling the Boolean lattice with copies of a poset
|
Gruslys, Vytautas
|
|
2017
|
61 |
C |
p. 535-539
|
artikel
|
| 134 |
Towards a problem of Ruskey and Savage on matching extendability
|
Fink, Jiří
|
|
2017
|
61 |
C |
p. 437-443
|
artikel
|
| 135 |
Two-layer Drawings of Bipartite Graphs
|
Diwan, Ajit A.
|
|
2017
|
61 |
C |
p. 351-357
|
artikel
|
| 136 |
Two Posets of Noncrossing Set Partitions
|
Mühle, Henri
|
|
2017
|
61 |
C |
p. 885-891
|
artikel
|
| 137 |
3-uniform hypergraphs and linear cycles
|
Ergemlidze, Beka
|
|
2017
|
61 |
C |
p. 391-394
|
artikel
|
| 138 |
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs
|
Grósz, Dániel
|
|
2017
|
61 |
C |
p. 527-533
|
artikel
|
| 139 |
W 2-graphs and shedding vertices
|
Levit, Vadim E.
|
|
2017
|
61 |
C |
p. 797-803
|
artikel
|
| 140 |
When do combinatorial structures obey the Poisson-Dirichlet law?
|
Manstavičius, E.
|
|
2017
|
61 |
C |
p. 841-846
|
artikel
|
| 141 |
Winning fast in biased Maker-Breaker games
|
Mikalački, Mirjana
|
|
2017
|
61 |
C |
p. 863-868
|
artikel
|
Tijdschrift beschrijving