Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarThe Electronic Journal of Combinatorics, Volume 20
Volume 20, Number 1, 2013
- Jack H. Koolen, Joohyung Kim, Jongyook Park:
Distance-Regular Graphs with a Relatively Small Eigenvalue Multiplicity. P1 - Julia Böttcher, Jan Foniok:
Ramsey Properties of Permutations. P2 - Philippe Di Francesco, Rinat Kedem:
T-systems with Boundaries from Network Solutions. P3 - Jakob Jonsson:
Hom Complexes of Set Systems. P4 - Richard P. Anstee, Ruiyuan Chen:
Forbidden Submatrices: Some New Bounds and Constructions. P5 - Taylor F. Allison, Anant P. Godbole, Kathryn M. Hawley, Bill Kay:
Covering n-Permutations with (n+1)-Permutations. P6 - Adam M. Goyt, Brady L. Keller, Jonathan E. Rue:
Statistical Distributions and q-Analogues of k-Fibonacci Numbers. P7 - Kate Rudolph:
Pattern Popularity in 132-Avoiding Permutations. P8 - Zhi-Wei Sun:
Products and Sums Divisible by Central Binomial Coefficients. P9 - Gábor Simonyi, Claude Tardif, Ambrus Zsbán:
Colourful Theorems and Indices of Homomorphism Complexes. P10 - Shi-Mei Ma:
A Family of Two-Variable Derivative Polynomials for Tangent and Secant. P11 - Leila Maherani, Gholam Reza Omidi, Ghaffar Raeisi, Maryam Shahsiah:
The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs. P12 - Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
The Maximal Number of Runs in Standard Sturmian Words. P13 - Yang Jiao:
On the Sprague-Grundy Values of the 𝔽-Wythoff Game. P14 - Michel Lavrauw, Geertrui Van de Voorde:
Scattered Linear Sets and Pseudoreguli. P15 - István Miklós, Péter L. Erdös, Lajos Soukup:
Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence. P16 - Huajun Zhang:
Cross-Intersecting Families of Labeled Sets. P17 - András Gyárfás, Gábor N. Sárközy:
Monochromatic Path and Cycle Partitions in Hypergraphs. P18 - Michael S. Cavers, Karen Seyffarth:
Graphs with Large Distinguishing Chromatic Number. P19 - Daniel Gomez, Hans Lundmark, Jacek Szmigielski:
The Canada Day Theorem. P20 - Ricky Ini Liu:
Nonconvexity of the Set of Hypergraph Degree Sequences. P21 - Masataka Nakamura, Kenji Kashiwabara:
The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases. P22 - Zhongyuan Che, Karen L. Collins:
The Distinguishing Chromatic Number of Kneser Graphs. P23 - Tommaso Traetta:
On a Class of Highly Symmetric k-Factorizations. P24 - John R. Britnell, Mark Wildon:
Finding a Princess in a Palace: a Pursuit-Evasion Problem. P25 - Eric Lars Sundberg:
Extremal Hypergraphs for the Biased Erdős-Selfridge Theorem. P26 - Iwao Sato, Hideo Mitsuhashi, Hideaki Morita:
A New Determinant Expression for the Weighted Bartholdi Zeta Function of a Digraph. P27 - Joshua N. Cooper, Erik Lundberg, Brendan Nagle:
Generalized Pattern Frequency in Large Permutations. P28 - Ngoc Dai Nguyen, Minh Hai Nguyen, Duy Hieu Do, Anh Vinh Le:
Integral Cayley Graphs Generated by Distance Sets in Vector Spaces over Finite Fields. P29 - Jan Goedgebeur, Stanislaw P. Radziszowski:
New Computational Upper Bounds for Ramsey Numbers R(3, k). P30 - Samuel A. Alexander:
Biologically Unavoidable Sequences. P31 - Balázs Patkós:
Families that Remain k-Sperner Even After Omitting an Element of their Ground Set. P32 - Yair Caro, Adriana Hansberg:
New Approach to the k-Independence Number of a Graph. P33 - Amela Muratovic-Ribic, Qiang Wang:
Partitions and Compositions over Finite Fields. P34 - Van Bang Le, Florian Pfender:
Extremal Graphs Having No Stable Cutset. P35 - Jiangmin Pan, Bengong Lou, Cuifeng Liu:
Arc-transitive Pentavalent Graphs of Order 4pq. P36 - Tomás Kaiser, Jean-Sébastien Sereni, Zelealem B. Yilma:
Multiple Petersen Subdivisions in Permutation Graphs. P37 - Padraig Ó Catháin:
Inequivalence of Difference Sets: On a Remark of Baumert. P38 - Sean Cleary, Andrew Rechnitzer, Thomas Wong:
Common Edges in Rooted Trees and Polygonal Triangulations. P39 - Lukas Katthän:
Decomposing Sets of Inversions. P40 - Dirk Kreimer, Karen A. Yeats:
Properties of the Corolla Polynomial of a 3-regular Graph. P41 - Graeme Taylor, Gary R. W. Greaves:
Lehmer's Conjecture for Hermitian Matrices over the Eisenstein and Gaussian Integers. P42 - Marcel Kenji de Carli Silva, Levent Tunçel:
Optimization Problems over Unit-Distance Representations of Graphs. P43 - R. Julian R. Abel, Nicholas J. Cavenagh, Jaromy Kuhl:
Induced Subarrays of Latin Squares Without Repeated Symbols. P44 - William E. Clark, Xiang-dong Hou:
Galkin Quandles, Pointed Abelian Groups, and Sequence A000712. P45 - Jianguo Qian:
Enumeration of Unlabeled Directed Hypergraphs. P46 - Xin Guo Ce, Zhou Yue:
Residue Reduced Form of a Rational Function as an Iterated Laurent Series. P47 - Sara Saeedi Madani, Dariush Kiani:
On The Binomial Edge Ideal of a Pair of Graphs. P48 - Andy Parrish:
Toward a Graph Version of Rado's Theorem. P49 - Marcia J. Groszek:
Ramsey Properties of Countably Infinite Partial Orderings. P50 - Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood:
Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. P51 - Mirkó Visontai:
Some Remarks on the Joint Distribution of Descents and Inverse Descents. P52 - Raphael Yuster:
Edge-Disjoint Induced Subgraphs with Given Minimum Degree. P53 - Min Yan:
Combinatorial Tilings of the Sphere by Pentagons. P54 - Zhicong Lin:
On some Generalized q-Eulerian Polynomials. P55 - Jing Chen, Cai Heng Li, Ákos Seress:
A Family of Half-Transitive Graphs. P56 - József Balogh, Alexandr V. Kostochka, Andrew Treglown:
On Perfect Packings in Dense Graphs. P57 - Sarada Herke, Barbara M. Maenhaut:
Perfect 1-Factorisations of Circulants with Small Degree. P58 - Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, John Harris, Joy Singleton:
An Iterative Approach to the Traceability Conjecture for Oriented Graphs. P59 - Guillem Perarnau, Giorgis Petridis:
Matchings in Random Biregular Bipartite Graphs. P60 - Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar:
Making a Graph Crossing-Critical by Multiplying its Edges. P61 - Bostjan Frelih, Stefko Miklavic:
Edge Regular Graph Products. P62 - James J. Y. Zhao:
An Involution Proof of the Alladi-Gordon Key Identity for Schur's Partition Theorem. P63 - Afshin Behmaram, Shmuel Friedland:
Upper Bounds for Perfect Matchings in Pfaffian and Planar Graphs. P64 - Hong Liu:
Extremal Graphs for Blow-Ups of Cycles and Trees. P65 - Shabnam Malik, Ahmad Mahmood Qureshi, Tudor Zamfirescu:
Hamiltonicity of Cubic 3-Connected k-Halin Graphs. P66 - László A. Székely, Hua Wang:
Extremal Values of Ratios: Distance Problems vs. Subtree Problems in Trees. P67 - Geoffrey Exoo:
On Some Small Classical Ramsey Numbers. P68 - Antoni Lozano:
Symmetry Breaking in Tournaments. P69 - Stephen M. Shea:
Graph Labelings and Continuous Factors of Dynamical Systems. P70 - Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Gloria López-Chávez:
Biregular Cages of Girth Five. P71 - David Clark, Vladimir D. Tonchev:
Enumeration of (16, 4, 16, 4) Relative Difference Sets. P72 - David J. Galvin, Do Trong Thanh:
Stirling Numbers of Forests and Cycles. P73 - Debra L. Boutin:
The Cost of 2-Distinguishing Cartesian Powers. P74 - Josep Conde, Joan Gimbert, Josep González, Josep M. Miret, Ramiro Moreno:
Nonexistence of Almost Moore Digraphs of Diameter Four. P75 - William Y. C. Chen, Alvin Y. L. Dai, Theodore Dokos, Tim Dwyer, Bruce E. Sagan:
On 021-Avoiding Ascent Sequences. P76
Volume 20, Number 2, 2013
- Maurice Pouzet, Nicolas M. Thiéry:
Some Relational Structures with Polynomial Growth and their Associated Algebras I: Quasi-Polynomiality of the Profile. P1 - Martin Macaj, Ján Mazák:
Asymptotic Lower Bounds on Circular Chromatic Index of Snarks. P2 - Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Maximal Antichains of Minimum Size. P3 - Dhruv Mubayi, Randall Stading:
Coloring the Cube with Rainbow Cycles. P4 - Jonathan Bloom, Sergi Elizalde:
Pattern Avoidance in Matchings and Partitions. P5 - Alejandro H. Morales, Ekaterina A. Vassilieva:
Direct Bijective Computation of the Generating Series for 2 and 3-Connection Coefficients of the Symmetric Group. P6 - Christopher Carl Heckman, Roi Krakovski:
Erdös-Gyárfás Conjecture for Cubic Planar Graphs. P7 - Andries E. Brouwer, C. F. Mills, W. H. Mills, A. Verbeek:
Counting Families of Mutually Intersecting Sets. P8 - Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer:
The Biased Odd Cycle Game. P9 - William Y. C. Chen, Janet F. F. Peng, Harold R. L. Yang:
Decomposition of Triply Rooted Trees. P10 - Yidong Sun:
A Simple Proof of an Identity of Lacasse. P11 - Yannai A. Gonczarowski, Ehud Friedgut:
Sisterhood in the Gale-Shapley Matching Algorithm. P12 - Masanori Ando:
A Combinatorial Proof of an Identity for the Divisor Generating Function. P13 - Bart De Bruyn:
Non-Classical Hyperplanes of DW(5, q). P14 - Richard P. Brent, Judy-anne H. Osborn:
General Lower Bounds on Maximal Determinants of Binary Matrices. P15 - M. R. Faghihi, Ebrahim Ghorbani, Gholamreza B. Khosrovshahi, S. Tat:
On Optimality of Designs with Three Distinct Eigenvalues. P16 - Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley:
New Results in t-Tone Coloring of Graphs. P17 - Yevgeniy Rudoy:
An Inductive Approach to Constructing Universal Cycles on the k-Subsets of [n]. P18 - Denglan Cui, Yaoping Hou:
On the Skew Spectra of Cartesian Products of Graphs. P19 - Mark Mixer, Daniel Pellicer, Gordon I. Williams:
Minimal Covers of the Archimedean Tilings, Part II. P20 - Bert L. Hartnell, Douglas F. Rall:
On the Cartesian Product of Non Well-Covered Graphs. P21 - Matthieu Dufour, Silvia Heubach:
Circular Nim Games. P22 - Marcin Witkowski:
Random Lifts of Graphs are Highly Connected. P23 - Anthony Bonato, Przemyslaw Gordinowicz, Bill Kinnersley, Pawel Pralat:
The Capture Time of the Hypercube. P24 - Andrzej Rucinski, Andrzej Zak:
Hamilton Saturated Hypergraphs of Essentially Minimum Size. P25 - C. M. Harden, D. B. Penman:
Fixed Point Polynomials of Permutation Groups. P26 - Ashik Mathew Kizhakkepallathu, Patric R. J. Östergård, Alexandru Popa:
On the Shannon Capacity of Triangular Graphs. P27 - Alina F. Y. Zhao:
Excedance Numbers for the Permutations of Type B. P28 - Hao Pan:
Congruences for q-Lucas Numbers. P29 - Fateme Raei Barandagh, Amir Rahnamai Barghi:
On the Rank of p-Schemes. P30 - Karola Mészáros:
Labeling the Regions of the Type Cn Shi Arrangement. P31 - Ragnar Freij, Matthias Henze, Moritz W. Schmitt, Günter M. Ziegler:
Face Numbers of Centrally Symmetric Polytopes Produced from Split Graphs. P32 - Nathan B. Shank, Hannah Yang:
Coupon Collector Problem for Non-Uniform Coupons and Random Quotas. P33 - Matt Ollis, Devin Willmott:
An Extension Theorem for Terraces. P34 - Andrei Asinowski, Gill Barequet, Mireille Bousquet-Mélou, Toufik Mansour, Ron Y. Pinter:
Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations. P35 - Andrzej Zak:
Near Packings of Graphs. P36 - Joaquim Borges, Ivan Yu. Mogilnykh, Josep Rifà, Faina I. Solov'eva:
On the Number of Nonequivalent Propelinear Extended Perfect Codes. P37 - Péter Pál Pach, Gabriella Pluhár, András Pongrácz, Csaba A. Szabó:
The Number of Rooted Trees of Given Depth. P38 - Hua Han, Zai Ping Lu:
Affine Primitive Groups and Semisymmetric Graphs. P39 - Will Grilliette, Deborah E. Seacrest, Tyler Seacrest:
On Blow-Ups and Injectivity of Quivers. P40 - Romuald Lenczewski, Rafal Salapata:
Multivariate Fuss-Narayana Polynomials and their Application to Random Matrices. P41 - Iskander Aliev, Martin Henk, Eva Linke:
Integer Points in Knapsack Polytopes and s-Covering Radius. P42 - Devlin Mallory, Abigail Raz, Christino Tamon, Thomas Zaslavsky:
Which Exterior Powers are Balanced? P43 - Michael H. Albert, Vincent Vatter:
Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations. P44 - David E. Roberson:
Cores of Vertex Transitive Graphs. P45 - Fabrício Siqueira Benevides, Michal Przykucki:
On Slowly Percolating Sets of Minimal Size in Bootstrap Percolation. P46 - David S. Gunderson, Hanno Lefmann:
Graphs on Affine and Linear Spaces and Deuber Sets. P47 - Myrto Kallipoliti, Henri Mühle:
On the Topology of the Cambrian Semilattices. P48 - Anna R. B. Fan, Harold R. L. Yang, Rebecca T. Yu:
On the Maximum Number of k-Hooks of Partitions of n. P49 - Thomas W. Tucker:
Distinguishing Maps II: General Case. P50 - Yeow Meng Chee, Han Mao Kiah, Chengmin Wang:
Generalized Balanced Tournament Designs with Block Size Four. P51 - Colin McDiarmid:
Random Graphs from a Weighted Minor-Closed Class. P52 - Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir:
On the Union Complexity of Diametral Disks. P53 - Július Czap, Dávid Hudák:
On Drawings and Decompositions of 1-Planar Graphs. P54 - Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger:
Barred Preferential Arrangements. P55 - Anne Micheli, Dominique Rossin:
Counting k-Convex Polyominoes. P56