4 papers
Limits of Order Types
Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos +2
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obta…
Counterexamples to a conjecture of Harris on Hall ratio
Adam Blumenthal, Bernard Lidicky, Ryan R. Martin +3
The Hall ratio of a graph is the maximum value of taken over all non-null subgraphs of . For any graph, the Hall ratio is a lower-bound on its fractional c…
Fractional colorings of cubic graphs with large girth
Frantisek Kardos, Daniel Kral, Jan Volec
We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size…
Domination number of cubic graphs with large girth
Daniel Kral, Petr Skoda, Jan Volec
We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n/g)<3n/10+O(n/g).