1k citations
- Ruhr University BochumDE28 papers
- Sungkyunkwan UniversityKR28 papers
- Centre National de la Recherche ScientifiqueFR20 papers
- KTH Royal Institute of TechnologySE13 papers
- Stockholm UniversitySE12 papers
- Università Campus Bio-MedicoIT12 papers
- Italian Institute of TechnologyIT10 papers
- Novo Nordisk (Denmark)DK10 papers
- Rutherford Appleton LaboratoryGB9 papers
- University of Modena and Reggio EmiliaIT9 papers
- Chalmers University of TechnologySE6 papers
- Statistics SwedenSE6 papers
Showing 2019 · math.COShow all
3 papers · 2 filters
math.CO2019
Biased random k-SAT
Joel Larsson, Klas Markström
The basic random -SAT problem is: Given a set of Boolean variables, and clauses of size picked uniformly at random from the set of all such clauses on our variables,…
math.CO2019★ 1 cited
On restricted colorings of -edge colorable graphs
Lan Anh Pham
A cycle is -colored if its edges are properly colored by two distinct colors. A -edge colorable graph is a -regular graph that admits a proper -edge coloring in…
math.CO2019
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
Victor Falgas--Ravry, Klas Markström, Yi Zhao
We investigate a covering problem in -uniform hypergraphs (-graphs): given a -graph , what is , the least integer such that if is an -vertex -gr…