Charles University

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

10 papers · 2 filters

math.CO2015★ 2 cited

Matroid invariants and counting graph homomorphisms

Andrew Goodall, Guus Regts, Lluis Vena

The number of homomorphisms from a finite graph $F$ to the complete graph $K_{n}$ is the evaluation of the chromatic polynomial of $F$ at $n$ . Suitably scaled, this is the Tutte poly…

math.CO2015

Colored graphs without colorful cycles

Richard N. Ball, Aleš Pultr, Petr Vojtěchovský

A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a…

math.CO2015

Jordan-like characterization of automorphism groups of planar graphs

Pavel Klavík, Roman Nedela, Peter Zeman

We investigate automorphism groups of planar graphs. The main result is a complete recursive description of all abstract groups that can be realized as automorphism groups of plana…

math.CO2015★ 3 cited

Planar graphs have two-coloring number at most 8

Zdeněk Dvořák, Adam Kabela, Tomáš Kaiser

We prove that the two-colouring number of any planar graph is at most 8. This resolves a question of Kierstead et al. [SIAM J. Discrete Math.~23 (2009), 1548--1560]. The result is…

math.CO2015★ 7 cited

Fine structure of 4-critical triangle-free graphs II. Planar triangle-free graphs with two precolored 4-cycles

Zdeněk Dvořák, Bernard Lidický

We study 3-coloring properties of triangle-free planar graphs $G$ with two precolored 4-cycles $C_{1}$ and $C_{2}$ that are far apart. We prove that either every precoloring of $C_1\cu…

math.CO2015★ 1 cited

Major index distribution over permutation classes

Michal Opler

For a permutation $π$ the major index of $π$ is the sum of all indices $i$ such that $π_{i} > π_{i + 1}$ . It is well known that the major index is equidistributed with the number of in…

math.CO2015

On incidence coloring conjecture in Cartesian products of graphs

Petr Gregor, Borut Lužar, Roman Soták

An incidence in a graph $G$ is a pair $(v, e)$ where $v$ is a vertex of $G$ and $e$ is an edge of $G$ incident to $v$ . Two incidences $(v, e)$ and $(u, f)$ are adjacent if at least on…

math.CO2015★ 4 cited

Limits of Structures and the Example of Tree-Semilattices

Pierre Charbit, Lucas Hosseini, Patrice Ossona de Mendez

The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szemerédi's regularity lemma) got i…

math.CO2015★ 3 cited

First order limits of sparse graphs: Plane trees and path-width

Jakub Gajarsky, Petr Hlineny, Tomas Kaiser +5

Nesetril and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there…

math.CO2015★ 9 cited

First-order limits, an analytical perspective

Jaroslav Nesetril, Patrice Ossona de Mendez

In this paper we present a novel approach to graph (and structural) limits based on model theory and analysis. The role of Stone and Gelfand dualities is displayed prominently and…