K. Choromanski

activity

20142023

most citedRT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control

273 citations · 1.5k across the 75 of their papers we have counts for

collaborators

Showing 2014 · math.COShow all

3 papers · 2 filters

math.CO2014★ 1 cited

The Strong EH-Property and the Erdős-Hajnal Conjecture

Krzysztof Choromanski

The Erdős-Hajnal Conjecture states that for every $H$ there exists a constant $ε (H) > 0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique…

math.CO2014

All known prime Erdős-Hajnal tournaments satisfy $ε (H) = Ω (\frac{1}{∣ H ∣ ^{5} l o g ( ∣ H ∣ )})$

Krzysztof Choromanski

We prove that there exists $C > 0$ such that $ε (H) \geq \frac{C}{∣ H ∣ ^{5} l o g ( ∣ H ∣ )}$ , where $ε (H)$ is the Erdős-Hajnal coefficient of the tournament $H$ , for every prime tournament $H…

math.CO2014

Excluding pairs of tournaments

Krzysztof Choromanski

The Erdős-Hajnal conjecture states that for every given undirected graph $H$ there exists a constant $c (H) > 0$ such that every graph $G$ that does not contain $H$ as an induced subg…

The Strong EH-Property and the Erdős-Hajnal Conjecture

All known prime Erdős-Hajnal tournaments satisfy ε(H)=Ω(∣H∣5log(∣H∣)1​)

Excluding pairs of tournaments

All known prime Erdős-Hajnal tournaments satisfy $ε (H) = Ω (\frac{1}{∣ H ∣ ^{5} l o g ( ∣ H ∣ )})$