default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 61
Volume 61, August 2017
- Michael Drmota, Mihyun Kang
, Christian Krattenthaler, Jaroslav Nesetril:
Preface. 1-3 - Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Fair representation in dimatroids. 5-11 - Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Quasirandomness in hypergraphs. 13-19 - Elad Aigner-Horev, Hiêp Hàn:
Linear quasi-randomness of subsets of abelian groups and hypergraphs. 21-27 - Margarita Akhmejanova, Dmitry A. Shabanov:
Colorings of b-simple hypergraphs. 29-35 - Immanuel Albrecht:
On Finding Some New Excluded Minors for Gammoids. 37-43 - Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
Packing degenerate graphs greedily. 45-51 - Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. 53-60 - Andrei Asinowski, Gill Barequet, Yufei Zheng:
Enumerating Polyominoes with Fixed Perimeter Defect. 61-67 - Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On Induced Colourful Paths in Triangle-free Graphs. 69-75 - Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz:
Induced Ramsey-type results and binary predicates for point sets. 77-83 - Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov:
Equiangular lines and subspaces in Euclidean spaces. 85-91 - Afonso S. Bandeira, Asaf Ferber, Matthew Kwan:
Resilience for the Littlewood-Offord Problem. 93-99 - Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg:
Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version. 101-106 - Amir-Hossein Bateni, Thibault Manneville, Vincent Pilaud:
On quadrangulations and Stokes complexes. 107-113 - Stéphane Bessy, Jocelyn Thiebaut:
Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture. 115-121 - David I. Bevan, Robert Brignall, Andrew Elvey Price, Jay Pantone:
Staircases, dominoes, and the growth rate of 1324-avoiders. 123-129 - Vladimir A. Bondarenko, Andrei V. Nikolaev:
Some properties of the skeleton of the pyramidal tours polytope. 131-137 - Marthe Bonamy, Kitty Meeks:
The Interactive Sum Choice Number of Graphs. 139-145 - Fábio Botler, Alexandre Talon:
Decomposition of 8-regular graphs into paths of length 4. 147-153 - Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person:
Embedding spanning bounded degree subgraphs in randomly perturbed graphs. 155-161 - Henning Bruhn, Matthias Heinlein:
K4-expansions have the edge-Erdős-Pósa property. 163-168 - Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. 169-175 - Matija Bucic, Shoham Letzter, Benny Sudakov:
Monochromatic paths in random tournaments. 177-183 - Sebastián Bustamante, Hiêp Hàn, Maya Stein:
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles. 185-190 - Wouter Cames van Batenburg, Ross J. Kang:
Packing two graphs of even girth 10. 191-197 - Pilar Cano, Guillem Perarnau, Oriol Serra:
Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree. 199-205 - Jose Capco, Matteo Gallet, Georg Grasegger, Christoph Koutschan, Niels Lubbes, Josef Schicho:
Computing the number of realizations of a Laman graph. 207-213 - Cesar Ceballos, Arnau Padrol, Camilo Sarmiento:
ν-Tamari lattices via subword complexes. 215-221 - Steven Chaplick, Peter Zeman:
Combinatorial Problems on H-graphs. 223-229 - Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Yi Sun:
On universal partial words. 231-237 - Shuya Chiba:
On the difference between hamilton cycles and 2-factors with a prescribed number of cycles. 239-245 - Ho-Jin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan:
Chi-boundedness of graph classes excluding wheel vertex-minors. 247-253 - Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota:
On the number of r-transitive orientations of G(n, p). 255-261 - Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann:
Stability of extremal hypergraphs with applications to an edge-coloring problem. 263-269 - Gwendal Collet, Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana:
Threshold functions for small subgraphs: an analytic approach. 271-277 - Oliver Cooley, Penny Haxell, Mihyun Kang, Philipp Sprüssel:
Homological connectedness of random hypergraphs. 279-285 - Jan Corsten:
Grid Ramsey problem. 287-292 - David Coudert, Guillaume Ducoffe:
A simple approach for lower-bounding the distortion in any Hyperbolic embedding. 293-299 - Julien Courtiel, Éric Fusy, Mathias Lepoutre, Marni Mishna:
Bijections for walks ending on an axis, using open arc diagrams. 301-307 - Konrad K. Dabrowski, Daniël Paulusma:
Contracting Bipartite Graphs to Paths and Cycles. 309-315 - Ewan Davies, Matthew Jenssen, Barnaby Roberts, Will Perkins:
Tight bounds on the coefficients of partition functions via stability. 317-321 - Anuj Dawar, Simone Severini, Octavio Zapata:
Pebble Games and Cospectral Graphs. 323-329 - Michal Debski, Jaroslaw Grytczuk, Urszula Pastwa, Barbara Pilat, Joanna Sokól, Michal Tuczynski, Przemyslaw Wenus, Krzysztof Wesek:
On avoding r-repetitions in ℝ2. 331-337 - Michelle Delcourt, Luke Postle:
On Star Decompositions of Random Regular Graphs. 339-342 - Michelle Delcourt, Luke Postle:
On the List Coloring Version of Reed's Conjecture. 343-349 - Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
Two-layer Drawings of Bipartite Graphs. 351-357 - Martin Dolezal, Jan Hladký, Ping Hu, Diana Piguet:
First steps in combinatorial optimization on graphons: Matchings. 359-365 - Chris Dowden, Mihyun Kang, Philipp Sprüssel:
The evolution of random graphs on surfaces. 367-373 - Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows. 375-381 - Zdenek Dvorák, Jakub Pekárek:
Irreducible 4-critical triangle-free toroidal graphs. 383-389 - Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-uniform hypergraphs and linear cycles. 391-394 - Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia:
A note on the maximum number of triangles in a C5-free graph. 395-398 - Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé:
Additive bases and flows in graphs. 399-405 - Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan, Jan Volec:
The codegree threshold of K4-. 407-413 - Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling graphs, chromatic number, and orthogonal tree-decompositions. 415-420 - Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Pentagon Contact Representations. 421-427 - Jirí Fiala, Jan Hubicka, Yangjing Long:
Gaps in full homomorphism order. 429-435 - Jirí Fink, Tomás Dvorák, Petr Gregor, Tomás Novotný:
Towards a problem of Ruskey and Savage on matching extendability. 437-443 - Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang:
Compatible Cycle Decomposition of bad K5-minor-free graphs. 445-449 - Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. 451-457 - Jacob Fox, Fan Wei:
On the Local Approach to Sidorenko's Conjecture. 459-465 - Mathew C. Francis, Daniel Gonçalves:
Dushnik-Miller dimension of contact systems of d-dimensional boxes. 467-473 - Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel:
Embedding graphs in Euclidean space. 475-481 - Peter Frankl, Andrey Kupavskii:
Families with no matchings of size s. 483-489 - Shinya Fujita, Ruonan Li, Guanghui Wang:
Decomposing edge-colored graphs under color degree constraints. 491-497 - Zoltán Füredi, Ida Kantor:
Kneser ranks of random graphs and minimum difference representations. 499-503 - Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Matching Connectivity: On the Structure of Graphs with Perfect Matchings. 505-511 - Andrew J. Goodall, Bart Litjens, Guus Regts, Lluís Vena:
A Tutte polynomial for non-orientable maps. 513-519 - Dániel Grósz, Abhishek Methuku, Casey Tompkins:
On subgraphs of C2k-free graphs. 521-526 - Dániel Grósz, Abhishek Methuku, Casey Tompkins:
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs. 527-533 - Vytautas Gruslys, Imre Leader, István Tomon:
Tiling the Boolean lattice with copies of a poset. 535-539 - Andrzej Grzesik, Daniel Král', László Miklós Lovász:
Extremal graph theory and finite forcibility. 541-547 - Vladimir V. Gusev, Raphaël M. Jungers, Elena V. Pribavkina:
Generalized primitivity of labeled digraphs. 549-555 - Ervin Györi, Balázs Keszegh:
On the number of edge-disjoint triangles in K4-free graphs. 557-560 - Jie Han, Allan Lo, Nicolás Sanhueza-Matamala:
Covering and tiling hypergraphs with tight cycles. 561-567 - Mikael Hansson, Axel Hultman:
A word property for twisted involutions in Coxeter groups. 569-575 - Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring dense digraphs. 577-583 - Ishay Haviv, Dan Levy:
Symmetric Complete Sum-free Sets in Cyclic Groups. 585-591 - Dan Hefetz, Mykhaylo Tyomkyn:
On the inducibility of cycles. 593-599 - Winfried Hochstättler, Michael Wilhelmi:
Sticky matroids and Kantor's Conjecture. 601-606 - Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating the distance to a hereditary graph property. 607-613 - Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato:
Packing arborescences in random digraphs. 615-621 - Jan Hubicka, Jaroslav Nesetril:
Ramsey theorem for designs. 623-629 - Clemens Huemer, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira:
Characteristic polynomials of production matrices for geometric graphs. 631-637 - Radek Husek, Robert Sámal:
Homomorphisms of Cayley graphs and Cycle Double Covers. 639-645 - Óscar Iglesias Valiño, Francisco Santos:
Classification of empty lattice 4-simplices of width larger than 2. 647-653 - Wanchote Jiamjitrak, Erik Jan van Leeuwen:
Co-Bipartite Neighborhood Edge Elimination Orderings. 655-661 - Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor:
Colouring squares of claw-free graphs. 663-669 - Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-free colorings of graphs. 671-677 - Mihyun Kang, Tamás Makai, Oleg Pikhurko:
Supersaturation Problem for the Bowtie. 679-685 - Mihyun Kang, Michael Moßhammer, Philipp Sprüssel:
Evolution of the giant component in graphs on orientable surfaces. 687-693 - Ross J. Kang, François Pirot:
Distance colouring without one cycle length. 695-701 - Manuel Kauers, Rong-Hua Wang:
Lattice walks in the octant with infinite associated groups. 703-709 - Nathan Keller, Noam Lifshitz:
The Junta Method in Extremal Hypergraph Theory and Chvátal's Conjecture. 711-717 - Tom Kelly, Luke Postle:
A Local Epsilon Version of Reed's Conjecture. 719-725 - Jaehoon Kim, Hong Liu, Maryam Sharifzadeh, Katherine Staden:
Proof of Komlós's conjecture on Hamiltonian subsets. 727-733 - Tamás Király, Zsuzsa Mészáros-Karkus:
Finding strongly popular b-matchings in bipartite graphs. 735-741 - Tereza Klimosová, Diana Piguet, Václav Rozhon:
A skew version of the Loebl-Komlós-Sós conjecture. 743-749 - Tereza Klimosová, Stéphan Thomassé:
Decomposing graphs into paths and trees. 751-757
- Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht:
Monochromatic trees in random graphs. 759-764 - Matjaz Konvalinka:
A bijective proof of the hook-length formula for skew shapes. 765-771 - Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert:
On the Turán number of ordered forests. 773-779 - Dmitry Kravtsov, Nikolay Krokhmal, Dmitry A. Shabanov:
Panchromatic 3-coloring of a random hypergraph. 781-787 - Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó:
Random Strategies are Nearly Optimal for Generalized van der Waerden Games. 789-795 - Vadim E. Levit, Eugen Mandrescu:
W2-graphs and shedding vertices. 797-803 - Hong Liu, Oleg Pikhurko, Katherine Staden:
The minimum number of triangles in graphs of given order and size. 805-811 - Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot:
Decomposing tournaments into paths. 813-818 - Joshua Lockhart, Otfried Gühne, Simone Severini:
Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs. 819-825 - Vadim V. Lozin, Victor Zamaraev:
The structure and the number of P7-free bipartite graphs. 827-833 - Borut Luzar, Martina Mockovciaková, Roman Soták:
On a star chromatic index of subcubic graphs. 835-839 - Eugenijus Manstavicius:
When do combinatorial structures obey the Poisson-Dirichlet law? 841-846 - Alina R. Mayorova, Ekaterina A. Vassilieva:
On the structure constants of the descent algebra of the hyperoctahedral group. 847-853 - Tamás Mészáros, Lajos Rónyai:
Standard Monomials and Extremal Vector Systems. 855-861 - Mirjana Mikalacki, Milos Stojakovic:
Winning fast in biased Maker-Breaker games. 863-868 - Malte Milatz:
Directed Random Walks on Polytopes with Few Facets. 869-875 - Natasha Morrison, Jonathan A. Noel:
Extremal Bounds for Bootstrap Percolation in the Hypercube. 877-883 - Henri Mühle:
Two Posets of Noncrossing Set Partitions. 885-891 - Ljuben R. Mutafchiev:
An Asymptotic Scheme for Analysis of Expectations of Plane Partition Statistics. 893-899 - Torsten Mütze, Christoph Standke, Veit Wiechert:
A minimum-change version of the Chung-Feller theorem for Dyck paths. 901-907 - Zoltán Lóránt Nagy:
Generalizing Erdős, Moon and Moser's result - The number of k-dominating independent sets. 909-915 - Tomoki Nakamigawa, Tadashi Sakuma:
The Expansion of a Chord Diagram and the Tutte Polynomial. 917-923 - Diego Nicodemos, Matej Stehlík:
Packing and covering odd cycles in cubic plane graphs with small faces. 925-931 - Marc Noy, Clément Requilé, Juanjo Rué:
Enumeration of labeled 4-regular planar graphs. 933-939 - Seongmin Ok, Thomas J. Perrett:
Density of Real Zeros of the Tutte Polynomial. 941-946 - Liudmila Ostroumova Prokhorenkova, Pawel Pralat, Andrei M. Raigorodskii:
Modularity in several random graph models. 947-953 - Lale Özkahya, Yury Person:
Minimum rainbow H-decompositions of graphs. 955-961 - Boram Park, Seonjeong Park:
Shellable posets arising from the even subgraphs of a graph. 963-969 - Viresh Patel, Guus Regts:
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. 971-977 - Diana Piguet, Maria Saumell:
A Median-Type Condition for Graph Tiling. 979-985 - Vincent Pilaud, Viviane Pons:
Permutrees. 987-993 - Alexey Pokrovskiy, Benny Sudakov:
Edge-disjoint rainbow trees in properly coloured complete graphs. 995-1001 - Alexandr Polyanskii:
Pairwise intersecting homothets of a convex body. 1003-1009 - Guus Regts, Bart Sevenster:
Partition functions from orthogonal and symplectic group invariants. 1011-1017 - Israel Rocha:
Spectral Bisection with Two Eigenvectors. 1019-1025 - Katarzyna Rybarczyk:
Hamilton cycles in the line graph of a random graph. 1027-1031 - A. A. Sagdeev:
On a Frankl-Rödl theorem and its geometric corollaries. 1033-1037 - Mikhail Tikhomirov:
On complexity of multidistance graph recognition in ℝ1. 1039-1045 - William T. Trotter, Bartosz Walczak:
Boolean Dimension and Local Dimension. 1047-1053 - Mykhaylo Tyomkyn:
Lagrangians of hypergraphs: The Frankl-Füredi conjecture holds almost everywhere. 1055-1059 - Rika Yatchak:
Automated Positive Part Extraction for Lattice Path Generating Functions in the Octant. 1061-1067
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-01 22:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
