Complete subgraphs are elusive

DOI10.1016/0095-8956(76)90021-6zbMath0293.05158OpenAlexW2065844587WikidataQ56210393 ScholiaQ56210393MaRDI QIDQ1212022

Béla Bollobás

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90021-6

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (11)

On the recognition complexity of some graph properties ⋮ Elusive properties of infinite graphs ⋮ Elusiveness of finding degrees ⋮ Elusiveness of Finding Degrees ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs ⋮ On the elusiveness of Hamiltonian property ⋮ On recognizing graph properties from adjacency matrices ⋮ Packings of graphs and applications to computational complexity ⋮ Decision tree complexity of graph properties with dimension at most 5 ⋮ A topological approach to evasiveness

Cites Work

• On the time required to detect cycles and connectivity in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Complete subgraphs are elusive