Login / Signup

A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number.

Alvaro CarboneroPatrick HompeBenjamin R. MooreSophie Spirkl
Published in: J. Comb. Theory, Ser. B (2023)
Keyphrases
  • small number
  • data sets
  • image processing
  • computational complexity
  • maximum number
  • social network analysis
  • model checking
  • graph matching
  • graph theory
  • graph mining
  • huge number
  • maximum common subgraph