Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive

DOI10.1007/978-3-642-38236-9_21zbMATH Open1382.68173OpenAlexW2179410341MaRDI QIDQ4922129FDOQ4922129

Authors: Raghav Kulkarni, Youming Qiao, Xiaoming Sun 

Publication date: 28 May 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/41379

Recommendations

• Any monotone property of 3-uniform hypergraphs is weakly evasive
• Monotone properties of \(k\)-uniform hypergraphs are weakly evasive
• Monotone Properties of k -Uniform Hypergraphs Are Weakly Evasive
• Every Monotone 3‐Graph Property is Testable
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• Monotone Bipartite Graph Properties are Evasive
• A Motzkin-Straus type result for 3-uniform hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On the Erdős-Hajnal problem for 3-uniform hypergraphs
• On 3-uniform hypergraphs without linear cycles

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65)

Cited In (3)

• Any monotone property of 3-uniform hypergraphs is weakly evasive
• Monotone Properties of k -Uniform Hypergraphs Are Weakly Evasive
• Monotone properties of \(k\)-uniform hypergraphs are weakly evasive

This page was built for publication: Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922129)