| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Bound for the Diameter of Distance-Regular Graphs
|
Pyber, L.
|
|
1999
|
|
4 |
p. 549-553
|
artikel
|
| 2 |
A Brooks-Type Result for Sparse Critical Graphs
|
Kostochka, Alexandr
|
|
2018
|
|
4 |
p. 887-934
|
artikel
|
| 3 |
Accessibility in Transitive Graphs
|
Hamann, Matthias
|
|
2018
|
|
4 |
p. 847-859
|
artikel
|
| 4 |
A colorful theorem on transversal lines to plane convex sets
|
Arocha, Jorge L.
|
|
2008
|
|
4 |
p. 379-384
|
artikel
|
| 5 |
A Combinatorial Algorithm for the Minimum (2, r)-Metric Problem and Some Generalizations
|
Karzanov, Alexander V.
|
|
1998
|
|
4 |
p. 549-568
|
artikel
|
| 6 |
A Combinatorial Bijection on k-Noncrossing Partitions
|
Lin, Zhicong
|
|
|
|
4 |
p. 559-586
|
artikel
|
| 7 |
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution
|
Schulman, Leonard J.
|
|
|
|
4 |
p. 465-486
|
artikel
|
| 8 |
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution
|
Schulman, Leonard J.
|
|
2005
|
|
4 |
p. 465-486
|
artikel
|
| 9 |
Additive Complements with Narkiewicz's Condition
|
Chen, Yong-Gao
|
|
2019
|
|
4 |
p. 813-823
|
artikel
|
| 10 |
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
|
Linial, Nathan
|
|
2000
|
|
4 |
p. 545-568
|
artikel
|
| 11 |
A Diophantine Ramsey Theorem
|
Schoen, Tomasz
|
|
|
|
4 |
p. 581-599
|
artikel
|
| 12 |
A Large Family of Maximum Scattered Linear Sets of PG(1,qn) and Their Associated MRD Codes
|
Longobardi, G.
|
|
|
|
4 |
p. 681-716
|
artikel
|
| 13 |
Algorithms for Measuring Perturbability in Matroid Optimization
|
Frederickson, Greg N.
|
|
1998
|
|
4 |
p. 503-518
|
artikel
|
| 14 |
Almost Covers Of 2-Arc Transitive Graphs
|
Zhou, Sanming
|
|
2004
|
|
4 |
p. 731-745
|
artikel
|
| 15 |
Almost Sure Convergence of theMinimum Bipartite Matching Functional in EuclideanSpace
|
Boutet deMonvel, J. H.
|
|
2002
|
|
4 |
p. 523-530
|
artikel
|
| 16 |
A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces
|
Androulakis, George
|
|
2010
|
|
4 |
p. 359-385
|
artikel
|
| 17 |
A New Lower Bound For A Ramsey-Type Problem
|
Sudakov*, Benny
|
|
|
|
4 |
p. 487-498
|
artikel
|
| 18 |
A New Lower Bound For A Ramsey-Type Problem
|
Sudakov*, Benny
|
|
2005
|
|
4 |
p. 487-498
|
artikel
|
| 19 |
An exponential-type upper bound for Folkman numbers
|
Rödl, Vojtěch
|
|
2017
|
|
4 |
p. 767-784
|
artikel
|
| 20 |
An Upper Bound for d-dimensional Difference Sets
|
V. Stanchescu, Yonutz
|
|
2001
|
|
4 |
p. 591-595
|
artikel
|
| 21 |
An Upper Bound for the Cardinalityof an s-Distance Set inEuclidean Space
|
Bannai, Etsuko
|
|
2003
|
|
4 |
p. 535-557
|
artikel
|
| 22 |
An upper bound on the number of high-dimensional permutations
|
Linial, Nathan
|
|
2014
|
|
4 |
p. 471-486
|
artikel
|
| 23 |
A randomized embedding algorithm for trees
|
Sudakov, Benny
|
|
2010
|
|
4 |
p. 445-470
|
artikel
|
| 24 |
2-Arc-Transitive Regular Covers of Kn,n Having the Covering Transformation Group ℤp2
|
Du, Shaofei
|
|
2018
|
|
4 |
p. 803-826
|
artikel
|
| 25 |
A refinement of a result of Corrádi and Hajnal
|
Kierstead, H. A.
|
|
2014
|
|
4 |
p. 497-512
|
artikel
|
| 26 |
A theorem of Cohen on parapolar spaces
|
Shult, Ernest E.
|
|
2010
|
|
4 |
p. 435-444
|
artikel
|
| 27 |
A Two-Variable Interlace Polynomial
|
Arratia, Richard
|
|
2004
|
|
4 |
p. 567-584
|
artikel
|
| 28 |
A unifying approach to splitting-off
|
Bernáth, Attila
|
|
2012
|
|
4 |
p. 373-401
|
artikel
|
| 29 |
A Weighted Erdős-Ginzburg-Ziv Theorem
|
Grynkiewicz, David J.
|
|
2006
|
|
4 |
p. 445-453
|
artikel
|
| 30 |
Biased Positional Games for Which Random Strategies are Nearly Optimal
|
Bednarska, Małgorzata
|
|
2000
|
|
4 |
p. 477-488
|
artikel
|
| 31 |
Blocking Sets Of External Lines To A Conic In PG(2,q), q ODD
|
Aguglia*, Angela
|
|
2006
|
|
4 |
p. 379-394
|
artikel
|
| 32 |
Bonds Intersecting Cycles In A Graph
|
McGuinness, Sean
|
|
|
|
4 |
p. 439-450
|
artikel
|
| 33 |
Bonds Intersecting Cycles In A Graph
|
McGuinness, Sean
|
|
2005
|
|
4 |
p. 439-450
|
artikel
|
| 34 |
Bounds on Pairs of Families with Restricted Intersections
|
Sgall, Jiří
|
|
1999
|
|
4 |
p. 555-566
|
artikel
|
| 35 |
Cayley graphs on abelian groups
|
Dobson, Edward
|
|
2015
|
|
4 |
p. 371-393
|
artikel
|
| 36 |
Cayley Snarks and Almost Simple Groups
|
Nedela, Roman
|
|
2001
|
|
4 |
p. 583-590
|
artikel
|
| 37 |
Circuits Through Cocircuits In A Graph With Extensions To Matroids
|
McGuinness, Sean
|
|
|
|
4 |
p. 451-463
|
artikel
|
| 38 |
Circuits Through Cocircuits In A Graph With Extensions To Matroids
|
McGuinness, Sean
|
|
2005
|
|
4 |
p. 451-463
|
artikel
|
| 39 |
Classes of Matroids Closed Under Minors and Principal Extensions
|
Matúš, František
|
|
2018
|
|
4 |
p. 935-954
|
artikel
|
| 40 |
Colored graphs without colorful cycles
|
Ball, Richard N.
|
|
2007
|
|
4 |
p. 407-427
|
artikel
|
| 41 |
Coloring intersection graphs of x-monotone curves in the plane
|
Suk, Andrew
|
|
2014
|
|
4 |
p. 487-505
|
artikel
|
| 42 |
Colourings of the cartesian product of graphs and multiplicative Sidon sets
|
Pór, Attila
|
|
2009
|
|
4 |
p. 449-466
|
artikel
|
| 43 |
Compatible Hamilton cycles in Dirac graphs
|
Krivelevich, Michael
|
|
2017
|
|
4 |
p. 697-732
|
artikel
|
| 44 |
Complete subgraphs in multipartite graphs
|
Pfender, Florian
|
|
2012
|
|
4 |
p. 483-495
|
artikel
|
| 45 |
Complexity measures of sign matrices
|
Linial, Nati
|
|
2007
|
|
4 |
p. 439-463
|
artikel
|
| 46 |
Computing the Covering Radius of a Polytope with an Application to Lonely Runners
|
Cslovjecsek, Jana
|
|
|
|
4 |
p. 463-490
|
artikel
|
| 47 |
Computing the partition function for graph homomorphisms
|
Barvinok, Alexander
|
|
2017
|
|
4 |
p. 633-650
|
artikel
|
| 48 |
Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes
|
Feng, Tao
|
|
2014
|
|
4 |
p. 413-434
|
artikel
|
| 49 |
Convex Embeddings and Bisections of3-Connected Graphs1
|
Nagamochi, Hiroshi
|
|
2002
|
|
4 |
p. 537-554
|
artikel
|
| 50 |
Counting Hamilton Cycles in Dirac Hypergraphs
|
Ferber, Asaf
|
|
|
|
4 |
p. 665-680
|
artikel
|
| 51 |
Covering a Finite Abelian Group bySubset Sums
|
Gao, W.
|
|
2003
|
|
4 |
p. 599-611
|
artikel
|
| 52 |
Critical graphs without triangles: An optimum density construction
|
Pegden, Wesley
|
|
2013
|
|
4 |
p. 495-512
|
artikel
|
| 53 |
Decomposing simple permutations, with enumerative consequences
|
Brignall, Robert
|
|
2008
|
|
4 |
p. 385-400
|
artikel
|
| 54 |
Density and ramsey type results on algebraic equations with restricted solution sets
|
Csikvári, Péter
|
|
2012
|
|
4 |
p. 425-449
|
artikel
|
| 55 |
Density Conditions for Panchromatic Colourings of Hypergraphs
|
V. Kostochka, Alexandr
|
|
2001
|
|
4 |
p. 515-541
|
artikel
|
| 56 |
Density of Monochromatic Infinite Subgraphs
|
DeBiasio, Louis
|
|
2019
|
|
4 |
p. 847-878
|
artikel
|
| 57 |
Deterministic extractors for affine sources over large fields
|
Gabizon, Ariel
|
|
2008
|
|
4 |
p. 415-440
|
artikel
|
| 58 |
Diameters of random circulant graphs
|
Marklof, Jens
|
|
2013
|
|
4 |
p. 429-466
|
artikel
|
| 59 |
Discrepancy After Adding A Single Set
|
Kim, Jeong Han
|
|
|
|
4 |
p. 499-501
|
artikel
|
| 60 |
Discrepancy After Adding A Single Set
|
Kim, Jeong Han
|
|
2005
|
|
4 |
p. 499-501
|
artikel
|
| 61 |
Distinguishing labeling of the actions of almost simple groups
|
Seress, Ákos
|
|
2011
|
|
4 |
p. 489-506
|
artikel
|
| 62 |
Efficient Testing of Large Graphs
|
Alon, Noga
|
|
2000
|
|
4 |
p. 451-476
|
artikel
|
| 63 |
Equivalence in Finite-Variable Logics is Complete for Polynomial Time
|
Grohe, Martin
|
|
1999
|
|
4 |
p. 507-532
|
artikel
|
| 64 |
Error Reduction by ParallelRepetition—A Negative Result
|
Feige*, Uriel
|
|
2002
|
|
4 |
p. 461-478
|
artikel
|
| 65 |
Exact Bounds for Judicious Partitions of Graphs
|
Bollobás, B.
|
|
1999
|
|
4 |
p. 473-486
|
artikel
|
| 66 |
Excluding paths and antipaths
|
Chudnovsky, Maria
|
|
2014
|
|
4 |
p. 389-412
|
artikel
|
| 67 |
Expander Graphs — Both Local and Global
|
Chapman, Michael
|
|
|
|
4 |
p. 473-509
|
artikel
|
| 68 |
Expanders In Group Algebras
|
Meshulam, Roy
|
|
2004
|
|
4 |
p. 659-680
|
artikel
|
| 69 |
Expansion And Isoperimetric Constants For Product Graphs
|
Houdré, C.
|
|
2006
|
|
4 |
p. 455-473
|
artikel
|
| 70 |
Expansion Of Product Replacement Graphs
|
Gamburd, Alexander
|
|
2006
|
|
4 |
p. 411-429
|
artikel
|
| 71 |
Explicit Bounded-Degree Unique-Neighbor Concentrators
|
Capalbo*, Michael
|
|
|
|
4 |
p. 379-391
|
artikel
|
| 72 |
Explicit Bounded-Degree Unique-Neighbor Concentrators
|
Capalbo*, Michael
|
|
2005
|
|
4 |
p. 379-391
|
artikel
|
| 73 |
Explicit Expanders of Every Degree and Size
|
Alon, Noga
|
|
|
|
4 |
p. 447-463
|
artikel
|
| 74 |
Extractors for Small Zero-Fixing Sources
|
Pudlák, Pavel
|
|
|
|
4 |
p. 587-616
|
artikel
|
| 75 |
Extremal results for odd cycles in sparse pseudorandom graphs
|
Aigner-Horev, Elad
|
|
2014
|
|
4 |
p. 379-406
|
artikel
|
| 76 |
Extremal Set Systems with Weakly Restricted Intersections
|
H. Vu, Van
|
|
1999
|
|
4 |
p. 567-587
|
artikel
|
| 77 |
Finding Convex Sets in Convex Position
|
Tóth, Géza
|
|
2000
|
|
4 |
p. 589-596
|
artikel
|
| 78 |
Finite basis for analytic strong n-gaps
|
Avilées, Antonio
|
|
2013
|
|
4 |
p. 375-393
|
artikel
|
| 79 |
Fractional covers and matchings in families of weighted d-intervals
|
Aharoni, Ron
|
|
2017
|
|
4 |
p. 555-572
|
artikel
|
| 80 |
From Membership to Separation, aSimple Construction
|
Maurras, Jean François
|
|
2002
|
|
4 |
p. 531-536
|
artikel
|
| 81 |
Full Embeddings Of The Finite Dual Split Cayley Hexagons
|
Thas, J. A.
|
|
2004
|
|
4 |
p. 681-698
|
artikel
|
| 82 |
Generalising Fisher’s inequality to coverings and packings
|
Horsley, Daniel
|
|
2017
|
|
4 |
p. 673-696
|
artikel
|
| 83 |
Generalizations of the removal lemma
|
Rödl, Vojtěch
|
|
2009
|
|
4 |
p. 467-501
|
artikel
|
| 84 |
Geometry of Permutation Limits
|
Rahman, Mustazee
|
|
2019
|
|
4 |
p. 933-960
|
artikel
|
| 85 |
Graphs With 3n−6 Edges Not Containing A Subdivision Of K5
|
Mader, Wolfgang
|
|
|
|
4 |
p. 425-438
|
artikel
|
| 86 |
Graphs With 3n−6 Edges Not Containing A Subdivision Of K5
|
Mader, Wolfgang
|
|
2005
|
|
4 |
p. 425-438
|
artikel
|
| 87 |
Growth in Sumsets of Higher Convex Functions
|
Bradshaw, Peter J.
|
|
|
|
4 |
p. 769-789
|
artikel
|
| 88 |
Hadamard matrices of order 764 exist
|
Đoković, Dragomir Ž.
|
|
2008
|
|
4 |
p. 487-489
|
artikel
|
| 89 |
Hedetniemi's Conjecture and the Retracts of a Product of Graphs
|
Larose, Benoit
|
|
2000
|
|
4 |
p. 531-544
|
artikel
|
| 90 |
Homological Connectivity Of Random 2-Complexes
|
Linial*, Nathan
|
|
2006
|
|
4 |
p. 475-487
|
artikel
|
| 91 |
How Many Circuits Determine an Oriented Matroid?
|
Knauer, Kolja
|
|
2018
|
|
4 |
p. 861-885
|
artikel
|
| 92 |
How to decrease the diameter of triangle-free graphs
|
Erdős, Paul
|
|
1998
|
|
4 |
p. 493-501
|
artikel
|
| 93 |
Independent Sets In Association Schemes
|
Godsil*, C. D.
|
|
2006
|
|
4 |
p. 431-443
|
artikel
|
| 94 |
Infinitely connected subgraphs in graphs of uncountable chromatic number
|
Thomassen, Carsten
|
|
2017
|
|
4 |
p. 785-793
|
artikel
|
| 95 |
Internally 4-Connected Binary Matroids with Every Element in Three Triangles
|
Chun, Carolyn
|
|
2019
|
|
4 |
p. 825-845
|
artikel
|
| 96 |
Kissing Numbers of Regular Graphs
|
Bourque, Maxime Fortier
|
|
|
|
4 |
p. 529-551
|
artikel
|
| 97 |
Large Cliques in Hypergraphs with Forbidden Substructures
|
Holmsen, Andreas F.
|
|
|
|
4 |
p. 527-537
|
artikel
|
| 98 |
Lifts, derandomization, and diameters of Schreier graphs of Mealy automata
|
Malyshev, Anton
|
|
2017
|
|
4 |
p. 733-765
|
artikel
|
| 99 |
Limitations of VCG-based mechanisms
|
Dobzinski, Shahar
|
|
2011
|
|
4 |
p. 379-396
|
artikel
|
| 100 |
Linear Codes and CharacterSums
|
Linial*, Nathan
|
|
2002
|
|
4 |
p. 497-522
|
artikel
|
| 101 |
Linear k-blocking Sets
|
Lunardon, Guglielmo
|
|
2001
|
|
4 |
p. 571-581
|
artikel
|
| 102 |
List Coloring of Random and Pseudo-Random Graphs
|
Alon, Noga
|
|
1999
|
|
4 |
p. 453-472
|
artikel
|
| 103 |
List Homomorphisms and Circular Arc Graphs
|
Feder, Tomas
|
|
1999
|
|
4 |
p. 487-505
|
artikel
|
| 104 |
Local chromatic number of quadrangulations of surfaces
|
Mohar, Bojan
|
|
2013
|
|
4 |
p. 467-494
|
artikel
|
| 105 |
Locally finite homogeneous graphs
|
Hedman, Shawn
|
|
2010
|
|
4 |
p. 419-434
|
artikel
|
| 106 |
Local Tree-Width, Excluded Minors,and Approximation Algorithms
|
Grohe, Martin
|
|
2003
|
|
4 |
p. 613-632
|
artikel
|
| 107 |
Long paths and cycles in subgraphs of the cube
|
Long, Eoin
|
|
2013
|
|
4 |
p. 395-428
|
artikel
|
| 108 |
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs
|
Guruswami, Venkatesan
|
|
|
|
4 |
p. 545-579
|
artikel
|
| 109 |
Maximizing the Möbius Function of a Poset and the Sum of the Betti Numbers of the Order Complex
|
N. Kozlov, Dmitry
|
|
1999
|
|
4 |
p. 533-548
|
artikel
|
| 110 |
Measurable events indexed by products of trees
|
Dodos, Pandelis
|
|
2014
|
|
4 |
p. 427-470
|
artikel
|
| 111 |
Minimal Partitions Of A Box Into Boxes
|
Grytczuk, Jarosław
|
|
2004
|
|
4 |
p. 605-614
|
artikel
|
| 112 |
Mixed and Isoperimetric Estimates on the Log-Sobolev Constants of Graphs and Markov Chains
|
Houdré, Christian
|
|
2001
|
|
4 |
p. 489-513
|
artikel
|
| 113 |
More on the Extremal Number of Subdivisions
|
Conlon, David
|
|
|
|
4 |
p. 465-494
|
artikel
|
| 114 |
Morse Theory and Evasiveness
|
Forman, Robin
|
|
2000
|
|
4 |
p. 489-504
|
artikel
|
| 115 |
Multicover inequalities on colored complexes
|
Walker, Shawn Austin
|
|
2007
|
|
4 |
p. 489-501
|
artikel
|
| 116 |
Near Optimal Separation Of Tree-Like And General Resolution
|
Ben-Sasson*, Eli
|
|
2004
|
|
4 |
p. 585-603
|
artikel
|
| 117 |
3n − 5 Edges Do Force a Subdivision of
|
Mader, W.
|
|
1998
|
|
4 |
p. 569-595
|
artikel
|
| 118 |
New Results on Simplex-Clusters in Set Systems
|
Currier, Gabriel
|
|
|
|
4 |
p. 495-506
|
artikel
|
| 119 |
Note
|
Brandt, Stephan
|
|
2003
|
|
4 |
p. 693-696
|
artikel
|
| 120 |
Note A Ramsey Statement for Infinite Groups
|
Komjáth, Péter
|
|
2018
|
|
4 |
p. 1017-1020
|
artikel
|
| 121 |
Note making a K4-free graph bipartite
|
Sudakov, Benny
|
|
2007
|
|
4 |
p. 509-518
|
artikel
|
| 122 |
Note on limits of finite graphs
|
Elek, Gábor
|
|
2007
|
|
4 |
p. 503-507
|
artikel
|
| 123 |
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares
|
Luo, Rong
|
|
2004
|
|
4 |
p. 641-657
|
artikel
|
| 124 |
On a Conjecture of Kemnitz
|
Rónyai, Lajos
|
|
2000
|
|
4 |
p. 569-573
|
artikel
|
| 125 |
On a Generalization of Rédei’sTheorem
|
Gács, András
|
|
2003
|
|
4 |
p. 585-598
|
artikel
|
| 126 |
On a graph packing conjecture by Bollobás, Eldridge and Catlin
|
Kaul, Hemanshu
|
|
2008
|
|
4 |
p. 469-485
|
artikel
|
| 127 |
On Almost k-Covers of Hypercubes
|
Clifton, Alexander
|
|
|
|
4 |
p. 511-526
|
artikel
|
| 128 |
On Cayley Graphs on the Symmetric Group Generated by Tranpositions
|
Friedman, Joel
|
|
2000
|
|
4 |
p. 505-519
|
artikel
|
| 129 |
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
|
Karthik, C. S.
|
|
|
|
4 |
p. 539-573
|
artikel
|
| 130 |
On Connected [g,f +1]-Factors in Graphs
|
Li*†, Guojun
|
|
|
|
4 |
p. 393-405
|
artikel
|
| 131 |
On Connected [g,f +1]-Factors in Graphs
|
Li*†, Guojun
|
|
2005
|
|
4 |
p. 393-405
|
artikel
|
| 132 |
On embeddability and stresses of graphs
|
Nevo, Eran
|
|
2007
|
|
4 |
p. 465-472
|
artikel
|
| 133 |
On Gardner’s Conjecture
|
Kun, Gábor
|
|
|
|
4 |
p. 553-558
|
artikel
|
| 134 |
On Heilbronn’s Problem in HigherDimension
|
Lefmann, Hanno
|
|
2003
|
|
4 |
p. 669-680
|
artikel
|
| 135 |
On Shadows Of Intersecting Families
|
Ahlswede, R.
|
|
2004
|
|
4 |
p. 555-566
|
artikel
|
| 136 |
On Subsets with Small Product in Torsion-Free Groups
|
Hamidoune, Y. O.
|
|
1998
|
|
4 |
p. 529-540
|
artikel
|
| 137 |
On the Asymptotic Confirmation of the Faudree–Lehel Conjecture for General Graphs
|
Przybyło, Jakub
|
|
|
|
4 |
p. 791-826
|
artikel
|
| 138 |
On the chromatic number of random geometric graphs
|
Mcdiarmid, Colin
|
|
2011
|
|
4 |
p. 423-488
|
artikel
|
| 139 |
On the Chromatic Number ofTriangle-Free Graphs of Large Minimum Degree
|
Thomassen, Carsten
|
|
2002
|
|
4 |
p. 591-596
|
artikel
|
| 140 |
On the critical pair theory in abelian groups: Beyond Chowla’s Theorem
|
Hamidoune, Yahya O.
|
|
2008
|
|
4 |
p. 441-467
|
artikel
|
| 141 |
On the Existence of Disjoint Cycles in a Graph
|
Enomoto, Hikoe
|
|
1998
|
|
4 |
p. 487-492
|
artikel
|
| 142 |
On the Functionw(x)=|{1≤s≤k: x≡as (modns)}|
|
Sun, Zhi-Wei
|
|
2003
|
|
4 |
p. 681-691
|
artikel
|
| 143 |
On the Number of Bases of Almost All Matroids
|
Pendavingh, Rudi
|
|
2018
|
|
4 |
p. 955-985
|
artikel
|
| 144 |
On the Number of Edges in Colour-Critical Graphs and Hypergraphs
|
Kostochka, A. V.
|
|
2000
|
|
4 |
p. 521-530
|
artikel
|
| 145 |
On The Number Of Sets Of Cycle Lengths
|
Verstraëte, Jacques
|
|
2004
|
|
4 |
p. 719-730
|
artikel
|
| 146 |
On the Sparsity Order of a Graph and Its Deficiency in Chordality
|
Laurent, Monique
|
|
2001
|
|
4 |
p. 543-570
|
artikel
|
| 147 |
On The Structure Of Triangle-Free Graphs Of Large Minimum Degree
|
Łuczak*, Tomasz
|
|
2006
|
|
4 |
p. 489-493
|
artikel
|
| 148 |
On the Structure of Zerofree Sequences
|
Gao, Weidong
|
|
1998
|
|
4 |
p. 519-527
|
artikel
|
| 149 |
On the Support Size of Null Designs of Finite Ranked Posets
|
Cho, Soojin
|
|
1999
|
|
4 |
p. 589-595
|
artikel
|
| 150 |
Optimal Littlewood-Offord Inequalities in Groups
|
Juškevičius, Tomas
|
|
2019
|
|
4 |
p. 911-921
|
artikel
|
| 151 |
Oriented matroids and Ky Fan’s theorem
|
Živaljević, Rade T.
|
|
2010
|
|
4 |
p. 471-484
|
artikel
|
| 152 |
Packing directed circuits exactly
|
Guenin, Bertrand
|
|
2011
|
|
4 |
p. 397-421
|
artikel
|
| 153 |
Perfect difference sets constructed from Sidon sets
|
Cilleruelo, Javier
|
|
2008
|
|
4 |
p. 401-414
|
artikel
|
| 154 |
Perfect matchings in planar cubic graphs
|
Chudnovsky, Maria
|
|
2012
|
|
4 |
p. 403-424
|
artikel
|
| 155 |
Perfect Matchings Versus OddCuts
|
Szigeti, Zoltán
|
|
2002
|
|
4 |
p. 575-589
|
artikel
|
| 156 |
Powers of Hamilton cycles in pseudorandom graphs
|
Allen, Peter
|
|
2017
|
|
4 |
p. 573-616
|
artikel
|
| 157 |
Principally Unimodular Skew-Symmetric Matrices
|
Bouchet, André
|
|
1998
|
|
4 |
p. 461-486
|
artikel
|
| 158 |
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
|
Kühn, Daniela
|
|
2015
|
|
4 |
p. 451-469
|
artikel
|
| 159 |
Properly coloured Hamiltonian cycles in edge-coloured complete graphs
|
Lo, Allan
|
|
2015
|
|
4 |
p. 471-492
|
artikel
|
| 160 |
Random Lifts Of Graphs: Perfect Matchings
|
Linial*, Nathan
|
|
2005
|
|
4 |
p. 407-424
|
artikel
|
| 161 |
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube
|
Borgs, Christian
|
|
2006
|
|
4 |
p. 395-410
|
artikel
|
| 162 |
Read-Once Branching Programs,Rectangular Proofs of the Pigeonhole Principle and theTransversal Calculus
|
Razborov*, Alexander
|
|
2002
|
|
4 |
p. 555-574
|
artikel
|
| 163 |
Regular families of forests, antichains and duality pairs of relational structures
|
Erdős, Péter L.
|
|
2017
|
|
4 |
p. 651-672
|
artikel
|
| 164 |
Regular graphs of large girth and arbitrary degree
|
Dahan, Xavier
|
|
2014
|
|
4 |
p. 407-426
|
artikel
|
| 165 |
Remarks on a Ramsey theory for trees
|
Pach, János
|
|
2012
|
|
4 |
p. 473-482
|
artikel
|
| 166 |
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes
|
Du, Shaofei
|
|
|
|
4 |
p. 507-543
|
artikel
|
| 167 |
Revisiting Kneser’s Theorem for Field Extensions
|
Bachoc, Christine
|
|
2018
|
|
4 |
p. 759-777
|
artikel
|
| 168 |
Routing Permutations on Spectral Expanders via Matchings
|
Nenadov, Rajko
|
|
|
|
4 |
p. 737-742
|
artikel
|
| 169 |
Sabidussi versus Hedetniemi for three variations of the chromatic number
|
Godsil, Chris
|
|
2014
|
|
4 |
p. 395-415
|
artikel
|
| 170 |
Set Systems with few DisjointPairs
|
Bollobás*, Béla
|
|
2003
|
|
4 |
p. 559-570
|
artikel
|
| 171 |
Short Directed Cycles in Bipartite Digraphs
|
Seymour, Paul
|
|
|
|
4 |
p. 575-599
|
artikel
|
| 172 |
Simple Graph Density Inequalities with No Sum of Squares Proofs
|
Blekherman, Grigoriy
|
|
|
|
4 |
p. 455-471
|
artikel
|
| 173 |
Some remarks on the odd hadwiger’s conjecture
|
Kawarabayashi, Ken-ichi
|
|
2007
|
|
4 |
p. 429-438
|
artikel
|
| 174 |
Stronger Counterexamples to the Topological Tverberg Conjecture
|
Avvakumov, S.
|
|
|
|
4 |
p. 717-727
|
artikel
|
| 175 |
Structural Results For Planar Sets With Many Similar Subsets
|
Ábrego, Bernardo M.
|
|
2004
|
|
4 |
p. 541-554
|
artikel
|
| 176 |
Subgroup Growth of Virtually Cyclic Right-Angled Coxeter Groups and Their Free Products
|
Baik, Hyungryul
|
|
2019
|
|
4 |
p. 779-811
|
artikel
|
| 177 |
Sum-Free Sets and Related Sets
|
Bilu, Yuri
|
|
1998
|
|
4 |
p. 449-459
|
artikel
|
| 178 |
Tangle-Tree Duality: In Graphs, Matroids and Beyond
|
Diestel, Reinhard
|
|
2019
|
|
4 |
p. 879-910
|
artikel
|
| 179 |
Temperely-Lieb Algebras and theFour-Color Theorem
|
Kauffman*, Louis
|
|
2003
|
|
4 |
p. 653-667
|
artikel
|
| 180 |
The Asymptotic Number of Score Sequences
|
Kolesnik, Brett
|
|
|
|
4 |
p. 827-844
|
artikel
|
| 181 |
The Bollobás-Thomason conjecture for 3-uniform hypergraphs
|
Haslegrave, John
|
|
2012
|
|
4 |
p. 451-471
|
artikel
|
| 182 |
The Characteristic Polynomial of a Random Matrix
|
Eberhard, Sean
|
|
|
|
4 |
p. 491-527
|
artikel
|
| 183 |
The colored Hadwiger transversal theorem in ℝd
|
Holmsen, Andreas F.
|
|
2014
|
|
4 |
p. 417-429
|
artikel
|
| 184 |
The Comparability Graph of a Modular Lattice
|
Hibi, Takayuki
|
|
1998
|
|
4 |
p. 541-548
|
artikel
|
| 185 |
The Cost of the Missing Bit: Communication Complexity with Help
|
Babai, László
|
|
2001
|
|
4 |
p. 455-488
|
artikel
|
| 186 |
The critical window for the classical Ramsey-Turán problem
|
Fox, Jacob
|
|
2014
|
|
4 |
p. 435-476
|
artikel
|
| 187 |
The Deletion Method For Upper Tail Estimates
|
Janson, Svante
|
|
2004
|
|
4 |
p. 615-640
|
artikel
|
| 188 |
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
|
Kawarabayashi, Ken-ichi
|
|
2014
|
|
4 |
p. 477-495
|
artikel
|
| 189 |
The Fixing Block Method inCombinatorics on Words
|
Currie, James D.
|
|
2003
|
|
4 |
p. 571-584
|
artikel
|
| 190 |
The Locally Connected Compact Metric Spaces Embeddable In The Plane
|
Thomassen, Carsten
|
|
2004
|
|
4 |
p. 699-718
|
artikel
|
| 191 |
The Minimally Non-Ideal Binary Clutters with a Triangle
|
Abdi, Ahmad
|
|
2019
|
|
4 |
p. 719-752
|
artikel
|
| 192 |
The Ramsey Numbers for A Triple of Long Cycles
|
Figaj, Agnieszka
|
|
2018
|
|
4 |
p. 827-845
|
artikel
|
| 193 |
The rectifiability threshold in abelian groups
|
Lev, Vsevolod F.
|
|
2008
|
|
4 |
p. 491-497
|
artikel
|
| 194 |
The three-in-a-tree problem
|
Chudnovsky, Maria
|
|
2010
|
|
4 |
p. 387-417
|
artikel
|
| 195 |
The Two-Point Fano and Ideal Binary Clutters
|
Abdi, Ahmad
|
|
2019
|
|
4 |
p. 753-777
|
artikel
|
| 196 |
The typical structure of graphs with no large cliques
|
Balogh, József
|
|
2017
|
|
4 |
p. 617-632
|
artikel
|
| 197 |
The universality of Hom complexes of graphs
|
Dochtermann, Anton
|
|
2009
|
|
4 |
p. 433-448
|
artikel
|
| 198 |
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices
|
Bonomo, Flavia
|
|
2018
|
|
4 |
p. 779-801
|
artikel
|
| 199 |
Three-color Ramsey numbers for paths
|
Gyárfás, András
|
|
2008
|
|
4 |
p. 499-502
|
artikel
|
| 200 |
Three Early Problems on Size Ramsey Numbers
|
Conlon, David
|
|
|
|
4 |
p. 743-768
|
artikel
|
| 201 |
Tilings of the integers can have superpolynomial periods
|
Steinberger, John P.
|
|
2009
|
|
4 |
p. 503-509
|
artikel
|
| 202 |
Total domination of graphs and small transversals of hypergraphs
|
Thomassé, Stéphan
|
|
2007
|
|
4 |
p. 473-487
|
artikel
|
| 203 |
Total Dual Integrality of Matching Forest Constraints
|
Schrijver, Alexander
|
|
2000
|
|
4 |
p. 575-588
|
artikel
|
| 204 |
Transitive Edge Coloring of Graphsand Dimension of Lattices
|
Gyárfás*, András
|
|
2002
|
|
4 |
p. 479-496
|
artikel
|
| 205 |
Treedepth vs Circumference
|
Briański, Marcin
|
|
|
|
4 |
p. 659-664
|
artikel
|
| 206 |
Tree-width and dimension
|
Joret, Gwenaël
|
|
2014
|
|
4 |
p. 431-450
|
artikel
|
| 207 |
Two Tree-Width-Like GraphInvariants
|
Holst, Hein van der
|
|
2003
|
|
4 |
p. 633-651
|
artikel
|
| 208 |
Uniformly cross intersecting families
|
Alon, Noga
|
|
2009
|
|
4 |
p. 389-431
|
artikel
|
| 209 |
Upper Bounds For Families Without Weak Delta-Systems
|
Naslund, Eric
|
|
|
|
4 |
p. 729-735
|
artikel
|
| 210 |
VC-Dimensions of Short Presburger Formulas
|
Nguyen, Danny
|
|
2019
|
|
4 |
p. 923-932
|
artikel
|
| 211 |
Weakly Norming Graphs are Edge-Transitive
|
Sidorenko, Alexander
|
|
|
|
4 |
p. 601-604
|
artikel
|
| 212 |
Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits
|
Regts, Guus
|
|
2018
|
|
4 |
p. 987-1015
|
artikel
|
Tijdschrift beschrijving