Erdős–Hajnal Conjecture for Graphs With Bounded VC-Dimension

Discrete and Computational Geometry - United States
doi 10.1007/s00454-018-0046-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

The Erdős–Hajnal Conjecture for Bull-Free Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2008English

Diameter Computation on H-Minor Free Graphs and Graphs of Bounded (Distance) VC-dimension

2020English

Some Remarks on the Erdős-Turán Conjecture

Acta Arithmetica
Number TheoryAlgebra
1993English

On a Conjecture of Erdős and Stewart

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2000English

Dynamic Monopolies for Interval Graphs With Bounded Thresholds

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

A Proof of the Erdős–Sands–Sauer–Woodrow Conjecture

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

An Erdős-Gallai Type Theorem for Vertex Colored Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

The Novikov Conjecture for Groups With Finite Asymptotic Dimension

Annals of Mathematics
UncertaintyStatisticsProbability
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy