Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             112 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions Kucheriya, Gaurav

6 p. 1111-1123
artikel
2 A characterization of the identity function with equation f(p+q+r)=f(p)+f(q)+f(r) Fang, Jin-Hui
2011
6 p. 697-701
artikel
3 Addendum To Schrijver's Work On Minimum Permanents Wanless*, Ian M.
2006
6 p. 743-745
artikel
4 A Family of Balanced Generalized Weighing Matrices Kharaghani, Hadi

6 p. 881-894
artikel
5 A Generalization of the Chevalley–Warning and Ax–Katz Theorems with a View Towards Combinatorial Number Theory Grynkiewicz, David J.

6 p. 1179-1213
artikel
6 Algorithms for finding an induced cycle in planar graphs Kawarabayashi, Ken-ichi
2010
6 p. 715-734
artikel
7 Almost covers of 2-arc transitive graphs Zhou, Sanming
2007
6 p. 745-746
artikel
8 A Local Version of Katona’s Intersecting Shadow Theorem Sales, Marcelo

6 p. 1075-1080
artikel
9 Analogues of the central point theorem for families with d-intersection property in ℝd Karasev, Roman N.
2012
6 p. 689-702
artikel
10 An asymptotic bound for the complexity of monotone graph properties Korneffel, Torsten
2010
6 p. 735-743
artikel
11 A Necessary and Sufficient Condition for (2d-2)-Transversals in R2d McGinnis, Daniel

6 p. 1103-1109
artikel
12 A nullstellensatz for sequences over $\mathbb{F}_p $ Balandraud, Éric
2011
6 p. 657-688
artikel
13 A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity Fujisawa, Jun
2011
6 p. 703-723
artikel
14 A phase transition for the metric distortion of percolation on the hypercube Angel, Omer
2007
6 p. 645-658
artikel
15 A Short Proof of Shih’s Isomorphism Theorem on Graphic Subspaces Ferchiou, Zouhaier

6 p. 805-837
artikel
16 A Short Proof of the Blow-Up Lemma for Approximate Decompositions Ehard, Stefan

6 p. 771-819
artikel
17 Asymptotic enumeration of integer matrices with large equal row and column sums Rodney Canfield, E.
2010
6 p. 655-680
artikel
18 Bipartite Kneser Graphs are Hamiltonian Mütze, Torsten
2016
6 p. 1207-1219
artikel
19 Bipartite Turán Problems for Ordered Graphs Methuku, Abhishek

6 p. 895-911
artikel
20 Bounded VC-Dimension Implies the Schur-Erdős Conjecture Fox, Jacob

6 p. 803-813
artikel
21 Castelnuovo-Mumford Regularity of Graphs Biyikoğlu, Türker
2018
6 p. 1353-1383
artikel
22 Connected but not path-connected subspaces of infinite graphs Georgakopoulos, Angelos
2007
6 p. 683-698
artikel
23 Convergence and Limits of Finite Trees Elek, Gábor

6 p. 821-852
artikel
24 Counting canonical partitions in the random graph Larson, Jean A.
2008
6 p. 659-678
artikel
25 Decomposing a Graph into Forests: The Nine Dragon Tree Conjecture is True Jiang, Hongbi
2016
6 p. 1125-1137
artikel
26 Degree bounded matroids and submodular flows Király, Tamás
2012
6 p. 703-720
artikel
27 Distance-Preserving Subgraphs of Johnson Graphs Chepoi, Victor
2016
6 p. 1039-1055
artikel
28 Effective Results on the Size and Structure of Sumsets Granville, Andrew

6 p. 1139-1178
artikel
29 Embedding a graph-like continuum in a surface Richter, R. Bruce
2015
6 p. 669-694
artikel
30 Embedding nearly-spanning bounded degree trees Alon, Noga
2007
6 p. 629-644
artikel
31 Equiangular Lines in Low Dimensional Euclidean Spaces Greaves, Gary R. W.

6 p. 839-872
artikel
32 Every non-Euclidean oriented matroid admits a biquadratic final polynomial Fukuda, Komei
2009
6 p. 691-698
artikel
33 Explicit sum-product theorems for large subsets of $$\mathbb{F}$$p Chang, Mei-Chu
2009
6 p. 629-635
artikel
34 Extending Factorizations of Complete Uniform Hypergraphs Amin Bahmanian, M.
2018
6 p. 1309-1335
artikel
35 Face numbers of generalized balanced Cohen-Macaulay complexes Browder, Jonathan
2011
6 p. 669-689
artikel
36 Finding Perfect Matchings in Bipartite Hypergraphs Annamalai, Chidambaram
2018
6 p. 1285-1307
artikel
37 Generating Random Regular Graphs Kim, J. H.
2006
6 p. 683-708
artikel
38 Graphs with the fewest matchings Keough, Lauren
2016
6 p. 703-723
artikel
39 Homotopy types of box complexes Csorba, Péter
2007
6 p. 669-682
artikel
40 Idiosynchromatic Poetry Weinert, Thilo V.
2014
6 p. 707-742
artikel
41 Impartial Digraphs Zhao, Yufei

6 p. 875-896
artikel
42 Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes Chudnovsky, Maria
2016
6 p. 1057-1072
artikel
43 Infinite families of new semifields Ebert, Gary L.
2009
6 p. 637-663
artikel
44 Inside S-inner product sets and Euclidean designs Nozaki, Hiroshi
2011
6 p. 725-737
artikel
45 Integer 4-Flows and Cycle Covers Fan, Genghua
2016
6 p. 1097-1112
artikel
46 (2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked Girão, António

6 p. 815-837
artikel
47 k-noncrossing and k-nonnesting graphs and fillings of ferrers diagrams Mier, Anna de
2007
6 p. 699-720
artikel
48 Lattice-point enumerators of ellipsoids Malikiosis, Romanos-Diogenes
2013
6 p. 733-744
artikel
49 Lines in hypergraphs Beaudou, Laurent
2013
6 p. 633-654
artikel
50 List Supermodular Coloring Iwata, Satoru
2018
6 p. 1437-1456
artikel
51 Lower bounds for boxicity Adiga, Abhijin
2011
6 p. 631-655
artikel
52 Maximal 3-Wise Intersecting Families Balogh, József

6 p. 1045-1066
artikel
53 Minimal Normal Graph Covers Gajser, David
2018
6 p. 1415-1436
artikel
54 Monochromatic triangles in two-colored plane Jelínek, Vít
2009
6 p. 699-718
artikel
55 New bounds in Balog-Szemerédi-Gowers theorem Schoen, Tomasz
2015
6 p. 695-701
artikel
56 New proofs of Plünnecke-type estimates for product sets in groups Petridis, Giorgis
2012
6 p. 721-733
artikel
57 Nonrepetitive colouring via entropy compression Dujmović, Vida
2016
6 p. 661-686
artikel
58 Note a Note on Disjoint Dijoins Mészáros, András
2018
6 p. 1485-1488
artikel
59 On a conjecture of Erdős and Simonovits: Even cycles Keevash, Peter
2013
6 p. 699-732
artikel
60 On An Extremal Hypergraph Problem Of Brown, Erdős And Sós Alon*, Noga
2006
6 p. 627-645
artikel
61 On a problem of Cilleruelo and Nathanson Chen, Yong-Gao
2011
6 p. 691-696
artikel
62 On a problem of Erdös and Rothschild on edges in triangles Fox, Jacob
2012
6 p. 619-628
artikel
63 One-way multiparty communication lower bound for pointer jumping with applications Viola, Emanuele
2009
6 p. 719-743
artikel
64 On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations Krawczyk, Tomasz
2016
6 p. 1139-1179
artikel
65 On order and rank of graphs Ghorbani, Ebrahim
2015
6 p. 655-668
artikel
66 On properties of random dissections and triangulations Bernasconi, Nicla
2010
6 p. 627-654
artikel
67 On the Directions Determined by a Cartesian Product in an Affine Galois Plane Di Benedetto, Daniel

6 p. 755-763
artikel
68 On the edge-density of 4-critical graphs Farzad, Babak
2009
6 p. 665-689
artikel
69 On the Linear Span of Lattice Points in a Parallelepiped Celaya, Marcel
2018
6 p. 1385-1413
artikel
70 On the monotonicity of a data stream Ergun, Funda
2015
6 p. 641-653
artikel
71 On the Number of Edge-Disjoint Triangles in K4-Free Graphs Győri, Ervin
2016
6 p. 1113-1124
artikel
72 On the problem of finding disjoint cycles and dicycles in a digraph Bang-Jensen, Jørgen
2011
6 p. 639-668
artikel
73 On the rigidity of molecular graphs Jackson, Bill
2008
6 p. 645-658
artikel
74 On the sum necessary to ensure that a degree sequence is potentially H-graphic Ferrara, Michael J.
2016
6 p. 687-702
artikel
75 Optimal strong parity edge-coloring of complete graphs Bunde, David P.
2008
6 p. 625-632
artikel
76 Partition Regularity of Generalised Fermat Equations Lindqvist, Sofia
2018
6 p. 1457-1483
artikel
77 Patterns in Random Permutations Even-Zohar, Chaim

6 p. 775-804
artikel
78 Points surrounding the origin Holmsen, Andreas F.
2008
6 p. 633-644
artikel
79 Privileged users in zero-error transmission over a noisy channel Alon, Noga
2007
6 p. 737-743
artikel
80 Probabilistic Refinement of the Asymptotic Spectrum of Graphs Vrana, Péter

6 p. 873-904
artikel
81 Proof of a conjecture of V. Nikiforov Terpai, Tamás
2011
6 p. 739-754
artikel
82 Proof of Schur’s Conjecture in ℝD Kupavskii, Andrey B.
2016
6 p. 1181-1205
artikel
83 Quasi-randomness and the distribution of copies of a fixed graph Shapira, Asaf
2008
6 p. 735-745
artikel
84 Reducing The Seed Length In The Nisan-Wigderson Generator* Impagliazzo†, Russell
2006
6 p. 647-681
artikel
85 Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth Huynh, Tony

6 p. 839-868
artikel
86 Small tight sets in finite elliptic, parabolic and Hermitian polar spaces Metsch, Klaus
2016
6 p. 725-744
artikel
87 Sorting under partial information (without the ellipsoid algorithm) Cardinal, Jean
2013
6 p. 655-697
artikel
88 Spanning a strong digraph by α circuits: A proof of Gallai’s conjecture Bessy, Stéphane
2007
6 p. 659-667
artikel
89 Spectral norm of random matrices Vu, Van H.
2007
6 p. 721-736
artikel
90 Stability Through Non-Shadows Gao, Jun

6 p. 1125-1137
artikel
91 1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio Dvořák, Zdenĕk

6 p. 759-774
artikel
92 Subspace Codes in PG(2N − 1, Q) Cossidente, Antonio
2016
6 p. 1073-1095
artikel
93 Substitutive Systems and a Finitary Version of Cobham’s Theorem Byszewski, Jakub

6 p. 765-801
artikel
94 The Chromatic Number of the Product of 5-Chromatic Graphs can be 4 Tardif, Claude

6 p. 1067-1073
artikel
95 The communication complexity of addition Viola, Emanuele
2015
6 p. 703-747
artikel
96 The Erdös-Ko-Rado theorem for twisted Grassmann graphs Tanaka, Hajime
2012
6 p. 735-740
artikel
97 The generalized almost resolvable cycle system problem Adams, Peter
2010
6 p. 617-625
artikel
98 The homology of a locally finite graph with ends Diestel, Reinhard
2010
6 p. 681-714
artikel
99 The minimum number of disjoint pairs in set systems and related problems Das, Shagnik
2016
6 p. 623-660
artikel
100 The Number of Maximal Independent Sets in the Hamming Cube Kahn, Jeff

6 p. 853-880
artikel
101 The Number of Unit-Area Triangles in the Plane: Theme and Variation Raz, Orit E.
2016
6 p. 1221-1240
artikel
102 The parity problem of polymatroids without double circuits Makai, Márton
2008
6 p. 679-692
artikel
103 The Strong Nine Dragon Tree Conjecture is True for d≤k+1 Mies, Sebastian

6 p. 1215-1239
artikel
104 The VC-Dimension of K-Vertex D-Polytopes Kupavskii, Andrey

6 p. 869-874
artikel
105 Three-point configurations determined by subsets of $$\mathbb{F}_q^2$$ via the Elekes-Sharir Paradigm Bennett, Mike
2014
6 p. 689-706
artikel
106 Transitivity conditions in infinite graphs Hamann, Matthias
2012
6 p. 649-688
artikel
107 Translational tilings by a polytope, with multiplicity Gravin, Nick
2012
6 p. 629-649
artikel
108 Translation Generalized Quadrangles In Even Characteristic Thas, Joseph A.
2006
6 p. 709-732
artikel
109 Treewidth of Grid Subsets Berger, Eli
2018
6 p. 1337-1352
artikel
110 Two Remarks Concerning Balanced Matroids Jerrum*, Mark
2006
6 p. 733-742
artikel
111 Weak Saturation of Multipartite Hypergraphs Bulavka, Denys

6 p. 1081-1102
artikel
112 When does the giant component bring unsatisfiability? Molloy, Michael
2008
6 p. 693-734
artikel
                             112 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland