output
19922026
most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2017 · math.COShow all

13 papers · 2 filters

math.CO2017★ 6 cited

Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4

Radoslav Fulek, Jan Kynčl

We find a graph of genus and its drawing on the orientable surface of genus with every pair of independent edges crossing an even number of times. This shows that the stron…

math.CO2017

Exponentially many nowhere-zero -, -, and -flows

Zdeněk Dvořák, Bojan Mohar, Robert Šámal

We prove that, in several settings, a graph has exponentially many nowhere-zero flows. These results may be seen as a counting alternative to the well-known proofs of existence of…

math.CO2017

Induced subdivisions and bounded expansion

Zdeněk Dvořák

We prove that for every graph H and for every integer s, the class of graphs that do not contain K_s, K_{s,s}, or any subdivision of H as an induced subgraph has bounded expansion;…

math.CO2017★ 6 cited

Completing graphs to metric spaces

Andrés Aranda, David Bradley-Williams, Eng Keat Hng +5

We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for part…

math.CO2017

Ramsey theorem for designs

Jan Hubička, Jaroslav Nešetřil

We prove that for any choice of parameters the class of all finite ordered designs with parameters is a Ramsey class.

math.CO2017

Gaps in full homomorphism order

Jiří Fiala, Jan Hubička, Yangjing Long

We characterise gaps in the full homomorphism order of graphs.

math.CO2017★ 15 cited

Ramsey properties and extending partial automorphisms for classes of finite structures

David M. Evans, Jan Hubička, Jaroslav Nešetřil

We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertic…

math.CO2017

Splittability and 1-amalgamability of permutation classes

Vít Jelínek, Michal Opler

A permutation class is splittable if it is contained in a merge of two of its proper subclasses, and it is 1-amalgamable if given two permutations and in , each with…

math.CO2017★ 10 cited

A superlinear lower bound on the number of 5-holes

Oswin Aichholzer, Martin Balko, Thomas Hackl +5

Let be a finite set of points in the plane in general position, that is, no three points of are on a common line. We say that a set of five points from is a -hol…

math.CO2017

Triangle-free planar graphs with small independence number

Zdeněk Dvořák, Jordan Venters

Since planar triangle-free graphs are 3-colourable, such a graph with n vertices has an independent set of size at least n/3. We prove that unless the graph contains a certain obst…

math.CO2017

Do triangle-free planar graphs have exponentially many 3-colorings?

Zdeněk Dvořák, Jean-Sébastien Sereni

Thomassen conjectured that triangle-free planar graphs have an exponential number of -colorings. We show this conjecture to be equivalent to the following statement: there exist…

math.CO2017

Kneser ranks of random graphs and minimum difference representations

Zoltán Füredi, Ida Kantor

Every graph is an induced subgraph of some Kneser graph of rank , i.e., there is an assignment of (distinct) -sets to the vertices such tha…

math.CO2017★ 1 cited

3-Flows with Large Support

Matt DeVos, Jessica McDonald, Irene Pivotto +2

We prove that every 3-edge-connected graph has a 3-flow with the property that . The graph demonstrates that this $\frac{5}…