Klas Markström

,

,

Eero Räty

Comb., October, 2024

The largest Condorcet domain on 8 alternatives.

[BibT_eX]

[DOI]

Charles R. Leedham-Green

,

,

Soc. Choice Welf., February, 2024

CDL: A fast and flexible library for the study of permutation sets with structural restrictions.

[BibT_eX]

[DOI]

Bei Zhou

,

,

SoftwareX, 2024

Enumeration of Row-Column Designs.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2024

Arrow's single peaked domains, richness, and domains for plurality and the Borda count.

[BibT_eX]

[DOI]

,

,

Bei Zhou

CoRR, 2024

Local Diversity of Condorcet Domains.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2024

Enumeration of Sets of Mutually Orthogonal Latin Rectangles.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2024

Polarised random -SAT.

[BibT_eX]

[DOI]

Joel Larsson Danielsson

,

Comb. Probab. Comput., November, 2023

Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Theor. Comput. Sci., 2023

Set-alternating schemes: A new class of large Condorcet domains.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2023

Condorcet Domains of Degree at most Seven.

[BibT_eX]

[DOI]

Dolica Akello-Egwell

,

Charles R. Leedham-Green

,

Alastair Litterick

,

,

CoRR, 2023

Minimum degree conditions for rainbow triangles.

[BibT_eX]

[DOI]

,

,

Eero Räty

CoRR, 2023

Efficient computation of permanents, with applications to Boson sampling and random matrices.

[BibT_eX]

[DOI]

,

J. Comput. Phys., 2022

Avoiding and Extending Partial Edge Colorings of Hypercubes.

[BibT_eX]

[DOI]

,

Per Johansson

,

Graphs Comb., 2022

Biased random k-SAT.

[BibT_eX]

[DOI]

Joel Larsson

,

Random Struct. Algorithms, 2021

Existence thresholds and Ramsey properties of random posets.

[BibT_eX]

[DOI]

,

,

,

Random Struct. Algorithms, 2020

Edge precoloring extension of hypercubes.

[BibT_eX]

[DOI]

,

,

Lan Anh Pham

J. Graph Theory, 2020

Restricted extension of sparse partial edge colorings of hypercubes.

[BibT_eX]

[DOI]

,

,

Lan Anh Pham

Discret. Math., 2020

Restricted completion of sparse partial Latin squares.

[BibT_eX]

[DOI]

Lina Jansson Andrén

,

,

Comb. Probab. Comput., 2019

Small Youden Rectangles and Their Connections to Other Row-Column Designs.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2019

Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices.

[BibT_eX]

[DOI]

,

Carsten Thomassen

CoRR, 2019

Triangle-degrees in graphs and tetrahedron coverings in 3-graphs.

[BibT_eX]

[DOI]

,

,

Yi Zhao

CoRR, 2019

Latin Cubes with Forbidden Entries.

[BibT_eX]

[DOI]

,

,

Lan Anh Pham

Electron. J. Comb., 2019

Full subgraphs.

[BibT_eX]

[DOI]

,

,

Jacques Verstraëte

J. Graph Theory, 2018

Triples of Orthogonal Latin and Youden Rectangles For Small Orders.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2018

Speed and concentration of the covering time for structured coupon collectors.

[BibT_eX]

[DOI]

,

Joel Larsson

,

CoRR, 2016

Random Subcube Intersection Graphs I: Cliques and Covering.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2016

The Straight Line Complexity of Small Factorials and Primorials.

[BibT_eX]

[DOI]

Integers, 2015

F-Factors in Hypergraphs Via Absorption.

[BibT_eX]

[DOI]

,

Graphs Comb., 2015

Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., 2015

Problem collection from the IML programme: Graphs, Hypergraphs, and Computing.

[BibT_eX]

[DOI]

CoRR, 2015

ℓ-Degree Turán Density.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2014

The thresholds for diameter 2 in random Cayley graphs.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 2014

Two Questions of Erdős on Hypergraphs above the Turán Threshold.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Perfect matchings in 3-partite 3-uniform hypergraphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2014

The range of thresholds for diameter 2 in random Cayley graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2014

The general graph homomorphism polynomial: Its relationship with other graph polynomials and partition functions.

[BibT_eX]

[DOI]

CoRR, 2014

Minimum codegree threshold for -factors.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2013

Generation and properties of snarks.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2013

A Multipartite Version of the Hajnal-Szemerédi Theorem for Graphs and Hypergraphs.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2013

Turán and Ramsey Properties of Subcube Intersection Graphs.

[BibT_eX]

[DOI]

J. Robert Johnson

,

Comb. Probab. Comput., 2013

Improved bounds for the shortness coefficient of cyclically 4-edge connected cubic graphs and snarks.

[BibT_eX]

[DOI]

CoRR, 2013

Shortest cycle covers and cycle double covers with large 2-regular subgraphs.

[BibT_eX]

[DOI]

Jonas Hägglund

,

CoRR, 2013

Random Latin square graphs.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 2012

Even cycle decompositions of 4-regular graphs and line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

On stable cycles and cycle double covers of graphs with large circumference.

[BibT_eX]

[DOI]

Jonas Hägglund

,

Discret. Math., 2012

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree.

[BibT_eX]

[DOI]

,

Andrew Thomason

,

Peter Wagner

Graphs Comb., 2011

Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees.

[BibT_eX]

[DOI]

,

Andrzej Rucinski

Eur. J. Comb., 2011

The Guessing Number of Undirected Graphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2011

The 1-vertex transfer matrix and accurate estimation of channel capacity.

[BibT_eX]

[DOI]

Shmuel Friedland

,

,

IEEE Trans. Inf. Theory, 2010

Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models.

[BibT_eX]

[DOI]

,

John C. Wierman

Electron. J. Comb., 2010

Unavoidable arrays.

[BibT_eX]

[DOI]

,

Lars-Daniel Öhman

Contributions Discret. Math., 2010

Factors of r-partite graphs and bounds for the Strong Chromatic Number.

[BibT_eX]

Anders Johansson

,

Robert Johansson

,

Ars Comb., 2010

Extremal hypergraphs and bounds for the Turán density of the 4-uniform K<sub>5</sub>.

[BibT_eX]

[DOI]

Discret. Math., 2009

The bivariate Ising polynomial of a graph.

[BibT_eX]

[DOI]

Daniel Andrén

,

Discret. Appl. Math., 2009

A note on uniquely pancyclic graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 2008

Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms.

[BibT_eX]

[DOI]

,

LMS J. Comput. Math., 2008

Fast multiplication of matrices over a finitely generated semiring.

[BibT_eX]

[DOI]

Daniel Andrén

,

Lars Hellström

,

Inf. Process. Lett., 2008

On the Number of Matchings in Regular Graphs.

[BibT_eX]

[DOI]

Shmuel Friedland

,

Elliot Krop

,

Electron. J. Comb., 2008

On the complexity of matrix reduction over finite fields.

[BibT_eX]

[DOI]

Daniel Andrén

,

Lars Hellström

,

Adv. Appl. Math., 2007

Locality and Hard SAT-Instances.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2006

Cycle double covers and spanning minors I.

[BibT_eX]

[DOI]

Roland Häggkvist

,

J. Comb. Theory B, 2006

Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials.

[BibT_eX]

[DOI]

,

Exp. Math., 2006

Uncountable families of vertex-transitive graphs of finite degree.

[BibT_eX]

[DOI]

Imre Leader

,

Discret. Math., 2006

Cycle double covers and spanning minors II.

[BibT_eX]

[DOI]

Roland Häggkvist

,

Discret. Math., 2006

Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs.

[BibT_eX]