Bounds for the boxicity of Mycielski graphs
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A box in Euclidean k-space is the Cartesian product of k closed intervals on the real line. The boxicity of a graph G, denoted by box(G), is the minimum nonnegative integer k such that G can be isomorphic to the intersection graph of a family of boxes in Euclidean k-space. Mycielski introduced an interesting graph operation that extends a graph G to a new graph M(G), called the Mycielski graph of G. In this paper we observe the behavior of boxicity of Mycielski graphs. We see that box(M(G)) is at least box(G) for a graph G, and hence we are interested in whether the boxicity of Mycielski graph of G is more than that of G or not. Here we give bounds for the boxicity of Mycielski graphs in terms of the number of universal vertices of G and the edge clique cover number of the complement of G. Further observations determine the boxicity of the Mycielski graph M(G) if G has no universal vertices or odd universal vertices and box(G) is equal to the edge clique cover number of the complement of G. We also present relations between the Mycielski graph M(G) and its generalizations M3(G) and Mr(G) in the context of boxicity, which will encourage us to calculate the boxicity of M(G) and M3(G).
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it