The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Comb."( http://dblp.L3S.de/Venues/Comb. )

URL (DBLP): http://dblp.uni-trier.de/db/journals/combinatorica

Publication years (Num. hits)
1981 (43) 1982 (44) 1983 (38) 1984 (46) 1985 (43) 1986 (36) 1987 (36) 1988 (38) 1989 (39) 1990 (31) 1991 (36) 1992 (46) 1993 (35) 1994 (37) 1995 (45) 1996 (46) 1997 (38) 1998 (41) 1999 (31) 2000 (39) 2001 (38) 2002 (35) 2003 (32) 2004 (54) 2005 (34) 2006 (40) 2007 (43) 2008 (44) 2009 (35) 2010 (38) 2011 (38) 2012 (36) 2013 (33) 2014 (32) 2015 (31) 2016 (33) 2017 (58) 2018 (61) 2019 (63) 2020 (35) 2021 (36) 2022 (59) 2023 (57) 2024 (20)
Publication types (Num. hits)
article(1773)
Venues (Conferences, Journals, ...)
Comb.(1773)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 363 occurrences of 75 keywords

Results
Found 1773 publication records. Showing 1773 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ben Green 0001, Robert Morris 0001 Counting sets with small sumset and applications. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Edward Dobson, Pablo Spiga, Gabriel Verret Cayley graphs on abelian groups. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tsai-Lien Wong, Xuding Zhu Every graph is (2, 3)-choosable. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Lauren Keough, Andrew John Radcliffe Graphs with the fewest matchings. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Allan Lo Properly coloured Hamiltonian cycles in edge-coloured complete graphs. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov On the densities of cliques and independent sets in graphs. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthias Hamann Spanning trees in hyperbolic graphs. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gregory L. Cherlin, Saharon Shelah Universal graphs with a forbidden subgraph: Block path solidity. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dieter Jungnickel, Klaus Metsch The characterization problem for designs with the parameters of AGd(n, q). Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Andreas F. Holmsen, Edgardo Roldán-Pensado The colored Hadwiger transversal theorem in ℝ d. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Carsten Thomassen Orientations of infinite graphs with prescribed edge-connectivity. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael J. Ferrara, Timothy D. LeSaulnier, Casey Moffatt, Paul S. Wenger On the sum necessary to ensure that a degree sequence is potentially H-graphic. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alexander Stoimenow A theorem on graph embedding with a relation to hyperbolic volume. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Swastik Kopparty Explicit subspace designs. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Chris D. Godsil, David E. Roberson, Robert Sámal, Simone Severini Sabidussi versus Hedetniemi for three variations of the chromatic number. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniela Kühn, Deryk Osthus, Timothy Townsend Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Guy Moshkovitz, Asaf Shapira A short proof of Gowers' lower bound for the regularity lemma. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tali Kaufman, Avi Wigderson Symmetric LDPC codes and local testing. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Justin Gilmer, Michael E. Saks, Srikanth Srinivasan 0001 Composition limits and separating examples for some boolean function complexity measures. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ori Parzanchevski, Ron Rosenthal, Ran J. Tessler Isoperimetric inequalities in simplicial complexes. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shagnik Das, Wenying Gan, Benny Sudakov The minimum number of disjoint pairs in set systems and related problems. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Florian Lehner Distinguishing graphs with intermediate growth. Search on Bibsonomy Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Emanuele Viola The communication complexity of addition. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Geoffrey R. Grimmett, Zhongyang Li Bounds on connective constants of regular graphs. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Cesar Ceballos, Francisco Santos, Günter M. Ziegler Many non-equivalent realizations of the associahedron. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Asaf Shapira, Benny Sudakov Small complete minors above the extremal edge density. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Miklós Abért, Tamás Hubai Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001 The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Alex Iosevich, Misha Rudnev, Yujia Zhai Areas of triangles and Beck's theorem in planes over finite fields. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tomasz Schoen New bounds in Balog-Szemerédi-Gowers theorem. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Funda Ergün, Hossein Jowhari On the monotonicity of a data stream. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Bartlomiej Bosek, Tomasz Krawczyk A subexponential upper bound for the on-line chain partitioning problem. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Richard Hoshino, Ken-ichi Kawarabayashi The edge density of critical digraphs. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nathan J. Bowler, Johannes Carmesin Matroid intersection, base packing and base covering for infinite matroids. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Adrian Dumitrescu, Csaba D. Tóth Packing anchored rectangles. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Csaba D. Tóth The Szemerédi-Trotter theorem in the complex plane. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jim Geelen, Peter Nelson An analogue of the Erdős-Stone theorem for finite geometries. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eckhard Steffen Intersecting 1-factors and nowhere-zero 5-flows. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1R. Bruce Richter, Brendan Rooney Embedding a graph-like continuum in a surface. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Assaf Rinot Chromatic numbers of graphs - large gaps. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Maria Chudnovsky, Paul D. Seymour Excluding paths and antipaths. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Pablo Soberón Equal coefficients and tolerance in coloured Tverberg partitions. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jacob Fox, Po-Shen Loh, Yufei Zhao The critical window for the classical Ramsey-Turán problem. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Matt DeVos, Bojan Mohar, Robert Sámal Highly arc-transitive digraphs - Structure and counterexamples. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Gábor Korchmáros, Gábor Péter Nagy, Nicola Pace k-nets embedded in a projective plane over a field. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie On order and rank of graphs. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Elchanan Mossel, Miklós Z. Rácz A quantitative Gibbard-Satterthwaite theorem without neutrality. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Rudi Pendavingh, Jorn G. van der Pol On the number of matroids. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hal A. Kierstead, Alexandr V. Kostochka A refinement of a result of Corrádi and Hajnal. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1David Ellis, Yuval Filmus, Ehud Friedgut A quasi-stability result for dictatorships in S n. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Bart De Bruyn, Frédéric Vanhove On Q-polynomial regular near 2d-gons. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tao Feng 0001, Koji Momihara, Qing Xiang Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Richard J. Martin, Michael J. Kearney Integral representation of certain combinatorial recurrences. Search on Bibsonomy Comb. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht Extremal results for odd cycles in sparse pseudorandom graphs. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jin-Xin Zhou, Yan-Quan Feng Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order 2P. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nathan Linial, Zur Luria An upper bound on the number of high-dimensional permutations. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Simon R. Blackburn, Thomas A. McCourt Triangulations of the sphere, bitrades and abelian groups. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Cédric Lecouvey Plünnecke and Kneser type theorems for dimension estimates. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zeev Nutov Approximating minimum-cost edge-covers of crossing biset-families. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan Lower bounds for boxicity. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Stephan Brandt, Janina Müttel, Dieter Rautenbach The circumference of the square of a connected graph. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1R. Bruce Richter, Brendan Rooney, Carsten Thomassen Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces". Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein Connectivity and tree structure in finite graphs. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Piotr Berman, Arnab Bhattacharyya 0001, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev Steiner transitive-closure spanners of low-dimensional posets. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros Measurable events indexed by products of trees. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy Partitioning 2-edge-colored graphs by monochromatic paths and cycles. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Roi Krakovski Topological minors in line graphs - A proof of Zha's conjecture. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1András Sebö, Jens Vygen Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan Constructing Ramsey graphs from Boolean function representations. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Yoshimi Egawa, Kenta Ozeki A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Aart Blokhuis, Andries E. Brouwer, Çiçek Güven Cocliques in the Kneser graph on the point-hyperplane flags of a projective space. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Tao Jiang 0003, Robert Seiver Exact solution of the hypergraph Turán problem for k-uniform linear paths. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1John Haslegrave Judicious partitions of uniform hypergraphs. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Matt DeVos, Zdenek Dvorák 0001, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide A minimum degree condition forcing complete graph immersion. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Thilo V. Weinert Idiosynchromatic Poetry. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Éric Balandraud, Benjamin Girard A nullstellensatz for sequences over Fp. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Alexandr V. Kostochka, Matthew P. Yancey Ore's conjecture for k=4 and Grötzsch's Theorem. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michael Bennett 0001, Alex Iosevich, Jonathan Pakianathan Three-point configurations determined by subsets of Fq2 via the Elekes-Sharir Paradigm. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Andrew Suk Coloring intersection graphs of x-monotone curves in the plane. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Amir Shpilka, Avishay Tal On the minimal fourier degree of symmetric Boolean functions. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Edita Mácajová, Martin Skoviera Sparsely intersecting perfect matchings in cubic graphs. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Yair Glasner Strong approximation in random towers of graphs. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1M. Amin Bahmanian Connected Baranyai's theorem. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus Optimal covers with Hamilton cycles in random graphs. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Xavier Dahan Regular graphs of large girth and arbitrary degree. Search on Bibsonomy Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Dániel Gerbner Profile polytopes of some classes of families. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Alexander I. Barvinok A bound for the number of vertices of a polytope with applications. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1James R. Lee, Anastasios Sidiropoulos Pathwidth, trees, and random embeddings. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro Sorting under partial information (without the ellipsoid algorithm). Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Antonio Avilés, Stevo Todorcevic Finite basis for analytic strong n-gaps. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorák 0001, Bojan Mohar Chromatic number and complete graph substructures for degree sequences. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Joshua Browning, Douglas S. Stones, Ian M. Wanless Bounds on the number of autotopisms and subsquares of a Latin square. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Gábor Kun Constraints, MMSNP and expander relational structures. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Stephen Huggett, Iain Moffatt Bipartite partial duals and circuits in medial graphs. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Alexander A. Sherstov Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Peter Keevash, Benny Sudakov, Jacques Verstraëte On a conjecture of Erdős and Simonovits: Even cycles. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dragan Masulovic Some classes of finite homomorphism-homogeneous point-line geometries. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jens Marklof, Andreas Strömbergsson Diameters of random circulant graphs. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Guy Wolfovitz K 4-free graphs without large induced triangle-free subgraphs. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Viktor Harangi On the density of triangles and squares in regular finite and unimodular random graphs. Search on Bibsonomy Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
Displaying result #401 - #500 of 1773 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license