1.4k citations
- Université Libre de BruxellesBE593 papers
- Vrije Universiteit BrusselBE588 papers
- RWTH Aachen UniversityDE587 papers
- Peking UniversityCN585 papers
- University of AntwerpBE585 papers
- University of HelsinkiFI583 papers
- European Organization for Nuclear ResearchCH582 papers
- UCLouvainBE582 papers
- Charles UniversityCZ581 papers
- Lappeenranta-Lahti University of TechnologyFI581 papers
- Sofia University "St. Kliment Ohridski"BG581 papers
- Universidade do Estado do Rio de JaneiroBR581 papers
13 papers · 1 filter
About maximal antichains in a product of two chains:A catch-all note
Denis Bouyssou, Thierry Marchant, Marc Pirlot
We establish one-to-one correspondences between maximal antichains in products of two finite linear orders and other mathematical objects, such as certain alignments of two strings…
Small Ramsey numbers for books, wheels, and generalizations
Bernard Lidický, Gwen McKinley, Florian Pfender +1
In this work, we give several new upper and lower bounds on Ramsey numbers for books and wheels, including a tight upper bound establishing , matching upper and l…
The minimum weight of the code of intersecting lines in
Sam Adriaensen, Robin Simoens, Leo Storme
We characterise the minimum weight codewords of the -ary linear code of intersecting lines in , , , prime, . If is even, the mini…
Generating Plane Quadrangulations and Symmetry-preserving Operations on Maps
Heidi Van den Camp, Brendan D. McKay
Lopsp-operations are operations on maps that are applied locally and are guaranteed to preserve all the orientation-preserving symmetries of maps. Well-known examples of such opera…
Exhaustive generation of edge-girth-regular graphs
Jan Goedgebeur, Jorik Jooken
Edge-girth-regular graphs (abbreviated as graphs) are a class of highly regular graphs. More specifically, for integers , , and an graph is a …
Spanning trees for many different numbers of leaves
Kenta Noguchi, Carol T. Zamfirescu
Let be a connected graph and the set of all integers such that contains a spanning tree with exactly leaves. We show that for a connected graph , the set…