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

Journal of Combinatorial Theory. Series B - United States
doi 10.1016/j.jctb.2008.02.005
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

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

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2018English

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

Acta Arithmetica
Number TheoryAlgebra
1993English

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

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

Variance of the Subgraph Count for Sparse Erdős–Rényi Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

On a Conjecture of Erdős and Stewart

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2000English

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

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

A Clone-Theoretic Formulation of the Erdős-Faber-Lovász Conjecture

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

The Flower Conjecture in Special Classes of Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
1995English

Partial Product of Graphs and Vizing's Conjecture

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy