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 2012 · math.COShow all

13 papers · 2 filters

math.CO2012

Cycle-continuous mappings -- order structure

Robert Šámal

Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for e…

math.CO2012

Flow-continuous mappings -- influence of the group

Robert Šámal

Many questions at the core of graph theory can be formulated as questions about certain group-valued flows: examples are the cycle double cover conjecture, Berge-Fulkerson conjectu…

math.CO2012★ 21 cited

Improved enumeration of simple topological graphs

Jan Kynčl

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges…

math.CO2012

Non-embeddability of geometric lattices and buildings

Martin Tancer, Kathrin Vorwerk

A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of…

math.CO2012★ 8 cited

Maximum size of reverse-free sets of permutations

Josef Cibulka

Two words have a reverse if they have the same pair of distinct letters on the same pair of positions, but in reversed order. A set of words no two of which have a reverse is said…

math.CO2012★ 25 cited

Erdos-Szekeres-type statements: Ramsey function and decidability in dimension 1

Boris Bukh, Jiri Matousek

A classical and widely used lemma of Erdos and Szekeres asserts that for every n there exists N such that every N-term sequence a of real numbers contains an n-term increasing subs…

math.CO2012

Mutually unbiased bases as submodules and subspaces

Joanne L. Hall, Jan Stovicek

Mutually unbiased bases (MUBs) have been used in several cryptographic and communications applications. There has been much speculation regarding connections between MUBs and finit…

math.CO2012

Planar Difference Functions

Joanne L. Hall, Asha Rao, Diane Donovan

In 1980 Alltop produced a family of cubic phase sequences that nearly meet the Welch bound for maximum non-peak correlation magnitude. This family of sequences were shown by Wooter…

math.CO2012★ 1 cited

Quasirandom permutations are characterized by 4-point densities

Daniel Král', Oleg Pikhurko

For permutations P and T of lengths |P|\le|T|, let t(P,T) be the probability that the restriction of T to a random |P|-point set is (order) isomorphic to P. We show that every sequ…

math.CO2012

Homomorphism-homogeneous L-colored graphs

David Hartman, Jan Hubicka, Dragan Masulovic

A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homom…

math.CO2012★ 2 cited

Improvement on the decay of crossing numbers

Jakub Černý, Jan Kynčl, Géza Tóth

We prove that the crossing number of a graph decays in a continuous fashion in the following sense. For any epsilon>0 there is a delta>0 such that for a sufficiently large n, every…

math.CO2012★ 10 cited

5-choosability of graphs with crossings far apart

Zdenek Dvorak, Bernard Lidicky, Bojan Mohar

We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings…

math.CO2012★ 58 cited

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

József Balogh, Ping Hu, Bernard Lidický +1

In this paper we modify slightly Razborov's flag algebra machinery to be suitable for the hypercube. We use this modified method to show that the maximum number of edges of a 4-cyc…