Pages that link to "Item:Q760439"
From MaRDI portal
The following pages link to Lower bound of the Hadwiger number of graphs by their average degree (Q760439):
Displaying 50 items.
- Average degree conditions forcing a minor (Q259170) (← links)
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- Small minors in dense graphs (Q427808) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Ramsey numbers of cubes versus cliques (Q519968) (← links)
- The edge-density for \(K_{2,t}\) minors (Q618032) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Boxicity, poset dimension, and excluded minors (Q668021) (← links)
- Forcing unbalanced complete bipartite minors (Q703605) (← links)
- Girth and treewidth (Q707020) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Dense graphs have \(K_{3,t}\) minors (Q709308) (← links)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Graphs without minor complete subgraphs (Q878614) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Disjoint unions of complete minors (Q941374) (← links)
- On \(K_{s,t}\)-minors in graphs with given average degree (Q941384) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- Tournaments as strong subcontractions (Q1377688) (← links)
- The extremal function for unbalanced bipartite minors (Q1408877) (← links)
- On the purity of minor-closed classes of graphs (Q1719590) (← links)
- The extremal function for Petersen minors (Q1748273) (← links)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- On \(K_{s,t}\)-minors in graphs with given average degree. II (Q1759392) (← links)
- The extremal function for complete minors (Q1850528) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- The Colin de Verdière parameter, excluded minors, and the spectral radius (Q2000642) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- On the hat guessing number of graphs (Q2075532) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
