Skip to main content
MathOverflow
Giorgio Camerani's user avatar
Giorgio Camerani's user avatar
Giorgio Camerani's user avatar
Giorgio Camerani
  • Member for 11 years, 3 months
  • Last seen more than a month ago
Profile Activity

11 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
revised
Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges
Updated by adding link to answer.
awarded
 Autobiographer
awarded
 Editor
revised
Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges
added 299 characters in body
awarded
 Student
comment
Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges
Please note that we consider all edge induced subgraphs, including non-connected ones, therefore I do not see why "complete hypergraphs should set the bar pretty high for $b$".
comment
Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges
By $k$-complete do you mean cliques of $k$ vertices? Could you please make your argument more clear?
comment
Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges
Of course every edge induced subgraph is $k$-uniform.
comment
Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges
mathworld.wolfram.com/Edge-InducedSubgraph.html
awarded
 Supporter
asked
Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges