Elusiveness of Finding Degrees

DOI10.1007/978-3-319-53007-9_22zbMath1487.05055OpenAlexW2585078467MaRDI QIDQ2971652

Venkatesh Raman, Varunkumar Jayapaul, Dishant Goyal

Publication date: 7 April 2017

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_22

zbMATH Keywords

elusivenessmaximum degree\(k\)-degreeadversary arguments

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (2)

Elusiveness of finding degrees ⋮ Single-Elimination Brackets Fail to Approximate Copeland Winner.

Cites Work

• A lower bound for the recognition of digraph properties
• Complete subgraphs are elusive
• On recognizing graph properties from adjacency matrices
• Evasiveness of Graph Properties and Topological Fixed-Point Theorems
• Finding Scores in Tournaments
• Perfectness is an Elusive Graph Property

This page was built for publication: Elusiveness of Finding Degrees